Returns the Frucht Graph.
The Frucht Graph is the smallest cubical graph whose automorphism group consists only of the identity element . It has 12 nodes and 18 edges and no nontrivial symmetries. It is planar and Hamiltonian .
- create_usingNetworkX graph constructor, optional (default=nx.Graph)
Graph type to create. If graph instance, then cleared before populated.
- Gnetworkx Graph
Frucht Graph with 12 nodes and 18 edges