Pseudo Dual Graph
by Fabian Schneider
Number of Vertices/Nodes:

Generation Speed:

Vertex/Node Size:

Dual Mode:

Background / Theme:
Definition: The dual graph of a plane graph G is a graph that has a vertex for each face of G. The dual graph has an edge whenever two faces of G are separated from each other by an edge, and a self-loop when the same face appears on both sides of an edge.
Read More: Wolfram MathWorld