# Frucht graph

In the mathematical field of graph theory, the Frucht graph is a 3-regular graph with 12 vertices, 18 edges, and no nontrivial symmetries. It was first described by Robert Frucht in 1939.

Frucht graph
The Frucht graph
Named afterRobert Frucht
Vertices12
Edges18
Radius3
Diameter4
Girth3
Automorphisms1 ({id})
Chromatic number3
Chromatic index3
PropertiesCubic
Halin
Pancyclic
Table of graphs and parameters

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].

## Algebraic properties

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 $(x-3)(x-2)x(x+1)(x+2)(x^{3}+x^{2}-2x-1)(x^{4}+x^{3}-6x^{2}-5x+4)$ .

## See also

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.