# graphscope.nx.generators.small.heawood_graph#

graphscope.nx.generators.small.heawood_graph(create_using=None)[source]#

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 1. It is cubic symmetric, nonplanar, Hamiltonian, and can be represented in LCF notation as [5,-5]^7 2. It is the unique (3,6)-cage: the regular cubic graph of girth 6 with minimal number of vertices 3.

Parameters

create_using (NetworkX graph constructor, optional (default=nx.Graph)) – Graph type to create. If graph instance, then cleared before populated.

Returns

G – Heawood Graph with 14 nodes and 21 edges

Return type

networkx Graph

References

1

https://en.wikipedia.org/wiki/Heawood_graph

2

https://mathworld.wolfram.com/HeawoodGraph.html

3

https://www.win.tue.nl/~aeb/graphs/Heawood.html