Combinatorial Dual || Dual in Graph Theory

A graph G∗ is said to be a combinatorial dual (sometimes also called algebraic dual) of another graph G if there is a bijection between their edges such that the polygons of one of them correspond to the cut-sets of the other, and vice versa. A graph can have no combinatorial duals, or it can have multiple non-isomorphic combinatorial duals.