tutte_graph#

tutte_graph(create_using=None)[source]#

Returns the Tutte graph.

The Tutte graph is a cubic polyhedral, non-Hamiltonian graph. It has 46 nodes and 69 edges. It is a counterexample to Tait’s conjecture that every 3-regular polyhedron has a Hamiltonian cycle. It can be realized geometrically from a tetrahedron by multiply truncating three of its vertices [1].

Parameters:
create_usingNetworkX graph constructor, optional (default=nx.Graph)

Graph type to create. If graph instance, then cleared before populated.

Returns:
Gnetworkx Graph

Tutte graph

References


Additional backends implement this function

cugraph : GPU-accelerated backend.