heawood_graph

Contents

heawood_graph#

graph_tool.collection.heawood_graph()[source]#

Returns the Heawood Graph, a (3,6) cage.

Returns:
gGraph

Heawood Graph with 14 nodes and 21 edges

Notes

The Heawood Graph is an undirected graph with 14 nodes and 21 edges, named after Percy John Heawood [heawood_wiki]. It is cubic symmetric, nonplanar, Hamiltonian, and can be represented in LCF notation as \([5,-5]^7\) [heawood]. It is the unique (3,6)-cage: the regular cubic graph of girth 6 with minimal number of vertices [heawood_cage].

References