Hubbry Logo
search
logo
630408

Klein graphs

logo
Community Hub0 Subscribers
Write something...
Be the first to start a discussion here.
Be the first to start a discussion here.
See all
Klein graphs

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.

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.

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}8.

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

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

The automorphism group of the Klein graph is the group PGL2(7) of order 336, which has PSL2(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

See all
User Avatar
No comments yet.