Returns the Heawood Graph, a (3,6) cage.
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 .
- create_usingNetworkX graph constructor, optional (default=nx.Graph)
Graph type to create. If graph instance, then cleared before populated.
- Gnetworkx Graph
Heawood Graph with 14 nodes and 21 edges