frucht_graph

graph_tool.collection.frucht_graph()

Returns the Frucht Graph.

Returns:

gGraph

Frucht Graph with 12 nodes and 18 edges

Notes

The Frucht Graph is the smallest cubical graph whose automorphism group consists only of the identity element [frucht_wiki]. It has 12 nodes and 18 edges and no nontrivial symmetries. It is planar and Hamiltonian [frucht].

References

[frucht_wiki]

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

[frucht]

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