| Holt graph | |
| Namesake: | Derek F. Holt |
| Vertices: | 27 |
| Edges: | 54 |
| Automorphisms: | 54 |
| Girth: | 5 |
| Diameter: | 3 |
| Radius: | 3 |
| Chromatic Number: | 3 |
| Chromatic Index: | 5 |
| Properties: | Vertex-transitive Edge-transitive Half-transitive Hamiltonian Eulerian Cayley graph |
| Book Thickness: | 3 |
| Queue Number: | 3 |
In graph theory, the Holt graph or Doyle graph is the smallest half-transitive graph, that is, the smallest example of a vertex-transitive and edge-transitive graph which is not also symmetric.[1] [2] Such graphs are not common.[3] It is named after Peter G. Doyle and Derek F. Holt, who discovered the same graph independently in 1976[4] and 1981[5] respectively.
The Holt graph has diameter 3, radius 3 and girth 5, chromatic number 3, chromatic index 5 and is Hamiltonian with distinct Hamiltonian cycles. It is also a 4-vertex-connected and a 4-edge-connected graph. It has book thickness 3 and queue number 3.[6]
It has an automorphism group of order 54. This is a smaller group than a symmetric graph with the same number of vertices and edges would have. The graph drawing on the right highlights this, in that it lacks reflectional symmetry.
The characteristic polynomial of the Holt graph is
(x3-6x+2)6(x+2)4(x-1)4(x-4).