heawood_graph(create_using=None)
The Heawood Graph is an undirected graph with 14 nodes and 21 edges, named after Percy John Heawood . It is cubic symmetric, nonplanar, Hamiltonian, and can be represented in LCF notation as [5,-5]^7
. It is the unique (3,6)-cage: the regular cubic graph of girth 6 with minimal number of vertices .
Graph type to create. If graph instance, then cleared before populated.
Heawood Graph with 14 nodes and 21 edges
Returns the Heawood Graph, a (3,6) cage.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them