Returns the Frucht Graph.
Frucht Graph with 12 nodes and 18 edges
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].