The Frucht graph is a pancyclic Halin graph with chromatic number 3, chromatic index 3, radius 3, and diameter 4. As with every Halin graph, the Frucht graph is polyhedral (planar and 3-vertex-connected) and Hamiltonian, with girth 3. Its independence number is 5.
The Frucht graph can be constructed from the LCF notation: [−5,−2,−4,2,5,−2,2,5,−2,−5,4,2].
The Frucht graph is one of the two smallest cubic graphs possessing only a single graph automorphism, the identity (that is, every vertex can be distinguished topologically from every other vertex). Such graphs are called asymmetric (or identity) graphs. Frucht's theorem states that any group can be realized as the group of symmetries of a graph, and a strengthening of this theorem also due to Frucht states that any group can be realized as the symmetries of a 3-regular graph; the Frucht graph provides an example of this realization for the trivial group.
The characteristic polynomial of the Frucht graph is [math](x-3) (x-2) x (x+1) (x+2) (x^3+x^2-2 x-1) (x^4+x^3-6 x^2-5 x+4)[/math].
The chromatic number of the Frucht graph is 3.
- Weisstein, Eric W.. "Frucht Graph". http://mathworld.wolfram.com/FruchtGraph.html.
- Frucht, R. (1939), "Herstellung von Graphen mit vorgegebener abstrakter Gruppe." (in German), Compositio Mathematica 6: 239–250, ISSN 0010-437X, http://www.numdam.org/item?id=CM_1939__6__239_0 .
- Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, 1990
- Frucht, R. (1949), "Graphs of degree three with a given abstract group", Canadian Journal of Mathematics 1: 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, http://cms.math.ca/cjm/v1/p365 .
https://en.wikipedia.org/wiki/Frucht graph was the original source. Read more.