Tutte–Coxeter graph

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Tutte–Coxeter graph
Tutte eight cage.svg
Named after W. T. Tutte
H. S. M. Coxeter
Vertices 30
Edges 45
Diameter 4
Girth 8
Automorphisms 1440 (Aut(S6))
Chromatic number 2
Chromatic index 3
Properties Cubic
Moore graph

In the mathematical field of graph theory, the Tutte–Coxeter graph or Tutte eight-cage is a 3-regular graph with 30 vertices and 45 edges. As the unique smallest cubic graph of girth 8 it is a cage and a Moore graph. It is bipartite, and can be constructed as the Levi graph of the generalized quadrangle W2 (known as the Cremona–Richmond configuration). The graph is named after William Thomas Tutte and H. S. M. Coxeter; it was discovered by Tutte (1947) but its connection to geometric configurations was investigated by both authors in a pair of jointly published papers (Tutte 1958; Coxeter 1958a).

All the cubic distance-regular graphs are known.[1] The Tutte–Coxeter is one of the 13 such graphs.

Constructions and automorphisms[edit]

A particularly simple combinatorial construction of the Tutte–Coxeter graph is due to Coxeter (1958b), based on work by Sylvester (1844). In modern terminology, take a complete graph on 6 vertices K6. It has 15 edges. There are 15 ways to choose 3 disjoint edges (that is, 15 perfect matchings of K6). Create a graph with 30 vertices corresponding to the 15 edges and the 15 perfect matchings, with an edge from each perfect matching to each of its three edges. That is the Tutte-Coxeter graph.

Based on this construction, Coxeter showed that the Tutte–Coxeter graph is a symmetric graph; it has a group of 1440 automorphisms, which may be identified with the automorphisms of the group of permutations on six elements (Coxeter 1958b). The inner automorphisms of this group correspond to permuting the six vertices of the K6 graph; these permutations act on the Tutte–Coxeter graph by permuting the vertices on each side of its bipartition while keeping each of the two sides fixed as a set. In addition, the outer automorphisms of the group of permutations swap one side of the bipartition for the other. As Coxeter showed, any path of up to five edges in the Tutte–Coxeter graph is equivalent to any other such path by one such automorphism.



  1. ^ Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. Distance-Regular Graphs. New York: Springer-Verlag, 1989.
  • Sylvester, J. J. (1844). "Elementary researches in the analysis of combinatorial aggregation". The Philos. Mag., Series 3 24: 285–295. 

External links[edit]