Coxeter graph
| Coxeter graph | |
|---|---|
The Coxeter graph | |
| Named after | H. S. M. Coxeter |
| Vertices | 28 |
| Edges | 42 |
| Radius | 4 |
| Diameter | 4 |
| Girth | 7 |
| Automorphisms | 336 (PGL2(7)) |
| Chromatic number | 3 |
| Chromatic index | 3 |
| Book thickness | 3 |
| Queue number | 2 |
| Properties | Symmetric Distance-regular Distance-transitive Cubic Hypohamiltonian |
| Table of graphs and parameters | |
In the mathematical field of graph theory, the Coxeter graph is a 3-regular graph with 28 vertices and 42 edges. It is one of the 13 known cubic distance-regular graphs. It is named after Harold Scott MacDonald Coxeter.