Frucht graph
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In graph theory, the Frucht graph is a cubic graph with 12 vertices, 18 edges, and no nontrivial symmetries. It was first described by Robert Frucht in 1949. The Frucht graph can be constructed from the LCF notation: . This describes it as a cubic graph in which two of the three adjacencies of each vertex form part of a Hamiltonian cycle and the numbers specify how far along the cycle to find the third neighbor of each vertex.
In graph theory, the Frucht graph is a cubic graph with 12 vertices, 18 edges, and no nontrivial symmetries. It was first described by Robert Frucht in 1949. The Frucht graph can be constructed from the LCF notation: . This describes it as a cubic graph in which two of the three adjacencies of each vertex form part of a Hamiltonian cycle and the numbers specify how far along the cycle to find the third neighbor of each vertex. ==Gallery== File:Frucht_graph_3COL.svg|The chromatic number of the Frucht graph is 3. File:Frucht Lombardi.svg| The Frucht graph is Hamiltonian. ==Further reading==
Text derived from https://en.wikipedia.org/w/index.php?oldid=1330216373 under CC BY-SA 4.0; modifications have been made.