Klein graphs

7-regular Klein graph
7-regular Klein graph
Named after	Felix Klein
Vertices	24
Edges	84
Radius	3
Diameter	3
Girth	3
Automorphisms	336
Chromatic number	4
Chromatic index	7
Properties	Symmetric; Hamiltonian
	Table of graphs and parameters

3-regular Klein graph
3-regular Klein graph
Named after	Felix Klein
Vertices	56
Edges	84
Radius	6
Diameter	6
Girth	7
Automorphisms	336
Chromatic number	3
Chromatic index	3
Book thickness	3
Queue number	2
Properties	Symmetric; Cubic; Hamiltonian
	Table of graphs and parameters

In the mathematical field of graph theory, the Klein graphs are two different but related regular graphs, each with 84 edges. Each can be embedded in the orientable surface of genus 3, in which they form dual graphs.

Surface of genus 3

The cubic Klein graph

This is a 3-regular (cubic) graph with 56 vertices and 84 edges, named after Felix Klein.

It is Hamiltonian, has chromatic number 3, chromatic index 3, radius 6, diameter 6 and girth 7. It is also a 3-vertex-connected and a 3-edge-connected graph. It has book thickness 3 and queue number 2.[1]

It can be embedded in the genus-3 orientable surface (which can be represented as the Klein quartic), where it forms the Klein map with 24 heptagonal faces, Schläfli symbol {7,3}₈.

According to the Foster census, the Klein graph, referenced as F056B, is the only cubic symmetric graph on 56 vertices which is not bipartite.[2]

It can be derived from the 28-vertex Coxeter graph.[3]

Algebraic properties

The automorphism group of the Klein graph is the group PGL₂(7) of order 336, which has PSL₂(7) as a normal subgroup. This group acts transitively on its half-edges, so the Klein graph is a symmetric graph.

The characteristic polynomial of this 56-vertex Klein graph is equal to $x^{7}\,(x-3)\,(x+2)^{6}\left(x^{2}-2\right)^{6}\left(x^{2}+x-4\right)^{7}\left(x^{2}-2x-1\right)^{8}$

Klein quartic tiled with 24 heptagons (Klein map)

In Hamiltonian path, drawn with 3 edge colors (showing that the chromatic index is 3)

The 7-regular Klein graph

This is a 7-regular graph with 24 vertices and 84 edges, named after Felix Klein.

It is Hamiltonian, has chromatic number 4, chromatic index 7, radius 3, diameter 3 and girth 3.

It can be embedded in the genus-3 orientable surface, where it forms the dual of the Klein map, with 56 triangular faces, Schläfli symbol {3,7}₈.[4]

It is the unique distance-regular graph with intersection array $\{7,4,1;1,2,7\}$ ; however, it is not a distance-transitive graph.[5]

Algebraic properties

The automorphism group of the 7-valent Klein graph is the same group of order 336 as for the cubic Klein map, likewise acting transitively on its half-edges.

The characteristic polynomial of this 24-vertices Klein graph is equal to $(x-7)(x+1)^{7}(x^{2}-7)^{8}$ .[6]

Klein quartic tiled with 56 triangles (dual of the Klein map)

References

Wolz, Jessica; Engineering Linear Layouts with SAT. Master Thesis, University of Tübingen, 2018
Conder, M.; Dobcsányi, P. (2002), "Trivalent symmetric graphs up to 768 vertices", J. Combin. Math. Combin. Comput., 40: 41–63.
Dejter, Italo (2010). "From the Coxeter graph to the Klein graph". CiteSeer. arXiv:1002.1960. CiteSeerX 10.1.1.188.2580. {{cite journal}}: Cite journal requires |journal= (help)
Schulte, Egon; Wills, J. M. (1985). "A Polyhedral Realization of Felix Klein's Map {3, 7}₈ on a Riemann Surface of Genus 3". J. London Math. Soc. s2-32 (3): 539–547. doi:10.1112/jlms/s2-32.3.539.
Brouwer, Andries; Cohen, Arjeh; Neumaier, Arnold (1989). Distance-Regular Graphs. Springer-Verlag. p. 386. ISBN 978-0-387-50619-7.
van Dam, E. R.; Haemers, W. H.; Koolen, J. H.; Spence, E. (2006). "Characterizing distance-regularity of graphs by the spectrum". J. Combin. Theory Ser. A. 113 (8): 1805–1820. doi:10.1016/j.jcta.2006.03.008.

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

[1] Wolz, Jessica; Engineering Linear Layouts with SAT. Master Thesis, University of Tübingen, 2018

[2] Conder, M.; Dobcsányi, P. (2002), "Trivalent symmetric graphs up to 768 vertices", J. Combin. Math. Combin. Comput., 40: 41–63.

[3] Dejter, Italo (2010). "From the Coxeter graph to the Klein graph". CiteSeer. arXiv:1002.1960. CiteSeerX 10.1.1.188.2580. {{cite journal}}: Cite journal requires |journal= (help)

[4] Schulte, Egon; Wills, J. M. (1985). "A Polyhedral Realization of Felix Klein's Map {3, 7}₈ on a Riemann Surface of Genus 3". J. London Math. Soc. s2-32 (3): 539–547. doi:10.1112/jlms/s2-32.3.539.

[5] Brouwer, Andries; Cohen, Arjeh; Neumaier, Arnold (1989). Distance-Regular Graphs. Springer-Verlag. p. 386. ISBN 978-0-387-50619-7.

[6] van Dam, E. R.; Haemers, W. H.; Koolen, J. H.; Spence, E. (2006). "Characterizing distance-regularity of graphs by the spectrum". J. Combin. Theory Ser. A. 113 (8): 1805–1820. doi:10.1016/j.jcta.2006.03.008.