Möbius–Kantor graph
| Möbius–Kantor graph | |
|---|---|
| Named after | August Ferdinand Möbius and S. Kantor |
| Vertices | 16 |
| Edges | 24 |
| Radius | 4 |
| Diameter | 4 |
| Girth | 6 |
| Automorphisms | 96 |
| Chromatic number | 2 |
| Chromatic index | 3 |
| Genus | 1 |
| Book thickness | 3 |
| Queue number | 2 |
| Properties | Symmetric Hamiltonian Bipartite Cubic Unit distance Cayley graph Perfect Orientably simple |
| Table of graphs and parameters | |
In the mathematical field of graph theory, the Möbius–Kantor graph is a symmetric bipartite cubic graph with 16 vertices and 24 edges named after August Ferdinand Möbius and Seligmann Kantor. It can be defined as the generalized Petersen graph G(8,3): that is, it is formed by the vertices of an octagon, connected to the vertices of an eight-point star in which each point of the star is connected to the points three steps away from it (an octagram).