Pseudo Dual Graph

by Fabian Schneider

Number of Vertices/Nodes:
Random 3 Vertices 4 Vertices 5 Vertices 6 Vertices 7 Vertices 8 Vertices 10 Vertices (MUCH RAM!) 15 Vertices (TOO MUCH RAM!)
Generation Speed:
Auto 100 Milsec. 250 Milsec. 500 Milsec. 1 Sec. 2 Sec. 3 Sec. 5 Sec. 10 Sec.
Vertex/Node Size:
Auto None 3px 5px 7px 10px 15px 20px
Dual Mode:
Center Reference Total Connections Cycle Labyrinth All Corners Colorful Black-and-White Points Only No Dual Image
Background / Theme:
Dark Light

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

Facebook
Twitter
Visit: fschneider.info