- Tutte–Coxeter graph
infobox graph
name = Tutte–Coxeter graph
image_caption =
namesake =W. T. Tutte H. S. M. Coxeter
vertices = 30
edges = 45
girth = 8
chromatic_number = 2
chromatic_index =
properties = Cubic CageMoore graph Arc-transitiveIn 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 smallestcubic graph of girth 8 it is a cage and aMoore graph . It is bipartite, and can be constructed as theLevi graph of the generalized quadrangle "W"2. The graph is named afterWilliam Thomas Tutte andH. 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).Duads, synthemes, and automorphisms
A particularly simple combinatorial construction of the Tutte-Coxeter graph is due to Coxeter (1958b), based on much earlier work by Sylvester (1844). From a set of six elements (for instance the letters a,b,c,d,e,f) Sylvester defined a "duad" to be one of the 15 unordered pairs of elements: ab, ac, ad, ae, af, bc, bd, be, bf, cd, ce, cf, de, df, or ef. He also defined a "syntheme" to be one of the 15 partitions of the elements into three duads: (ab,cd,ef), (ab,ce,df), etc. Each syntheme contains three duads, and each duad belongs to three synthemes. The Tutte-Coxeter graph can be viewed as having one vertex per duad, one vertex per syntheme, and an edge connecting each syntheme to each of the three duads that form it.
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). Theinner automorphism s of this group correspond to permuting the six elements from which we defined the morphemes and synthemes; 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, theouter automorphism s 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.References
*cite journal
author = Coxeter, H. S. M.
authorlink = H. S. M. Coxeter
title = The chords of the non-ruled quadric in PG(3,3)
journal = Canad. J. Math.
volume = 10
year = 1958a
pages = 484–488*cite journal
author = Coxeter, H. S. M.
authorlink = H. S. M. Coxeter
title = Twelve points in PG(5,3) with 95040 self-transformations
journal = Proc. Roy. Soc. London. Ser. A
volume = 247
year = 1958b
url = http://www.jstor.org/stable/100667
pages = 279–293*cite journal
author = Sylvester, J. J.
authorlink = J. J. Sylvester
title = Elementary researches in the analysis of combinatorial aggregation
journal = The Philos. Mag., Series 3
volume = 24
year = 1844
pages = 285–295*cite journal
author = Tutte, W. T.
authorlink = William Thomas Tutte
title = A family of cubical graphs
journal = Proc. Cambridge Philos. Soc.
volume = 43
year = 1947
pages = 459–474*cite journal
author = Tutte, W. T.
authorlink = William Thomas Tutte
title = The chords of the non-ruled quadric in PG(3,3)
journal = Canad. J. Math.
volume = 10
year = 1958
pages = 481–483External links
*
* [http://sma.uni.lu/bisdorff/RubyDataSets/Tuttes8cage.html Ruby Data set: The Tutte-Coxeter (Levi) graph]
*
Wikimedia Foundation. 2010.