Gosset graph

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Gosset graph
E7 graph.svg
Gosset graph (321)
(There are 3 rings of 18 vertices, and two vertices coincide in the center of this projection. Edges also coincide with this projection.)
Named afterThorold Gosset
PropertiesDistance-regular graph
Table of graphs and parameters

The Gosset graph, named after Thorold Gosset, is a specific regular graph (1-skeleton of the 7-dimensional 321 polytope) with 56 vertices and valency 27.[1]


The Gosset graph can be explicitly constructed as follows: the 56 vertices are the vectors in R8, obtained by permuting the coordinates and possibly taking the opposite of the vector (3, 3, −1, −1, −1, −1, −1, −1). Two such vectors are adjacent when their inner product is 8.

An alternative construction is based on the 8-vertex complete graph K8. The vertices of the Gosset graph can be identified with two copies of the set of edges of K8. Two vertices of the Gosset graph that come from the same copy are adjacent if they correspond to disjoint edges of K8; two vertices that come from different copies are adjacent if they correspond to edges that share a single vertex.[2]


In the vector representation of the Gosset graph, two vertices are at distance two when their inner product is −8 and at distance three when their inner product is −24 (which is only possible if the vectors are each other's opposite). In the representation based on the edges of K8, two vertices of the Gosset graph are at distance three if and only if they correspond to different copies of the same edge of K8. The Gosset graph is distance-regular with diameter three.[3]

The induced subgraph of the neighborhood of any vertex in the Gosset graph is isomorphic to the Schläfli graph.[3]

The automorphism group of the Gosset graph is isomorphic to the Coxeter group E7 and hence has order 2903040. The Gosset 321 polytope is a semiregular polytope. Therefore, the automorphism group of the Gosset graph, E7, acts transitively upon its vertices, making it a vertex-transitive graph.

The characteristic polynomial of the Gosset graph is[4]

Therefore, this graph is an integral graph.


  1. ^ Grishukhin, V. P. (2011), "Delone and Voronoĭ polytopes of the root lattice E7 and the dual lattice E7*", Trudy Matematicheskogo Instituta Imeni V. A. Skeklova (Klassicheskaya i Sovremennaya Matematika v Pole Deyatelnosti Borisa Nikolaevicha Delone), 275: 68–86, doi:10.1134/S0081543811080049, MR 2962971.
  2. ^ Haemers, Willem H. (1996), "Distance-regularity and the spectrum of graphs", Linear Algebra and its Applications, 236: 265–278, doi:10.1016/0024-3795(94)00166-9, MR 1375618.
  3. ^ a b Kabanov, V. V.; Makhnev, A. A.; Paduchikh, D. V. (2007), "Characterization of some distance-regular graphs by forbidden subgraphs", Doklady Akademii Nauk, 414 (5): 583–586, doi:10.1134/S1064562407030234, MR 2451915.
  4. ^ Brouwer, A. E.; Riebeek, R. J. (1998), "The spectra of Coxeter graphs", Journal of Algebraic Combinatorics, 8 (1): 15–28, doi:10.1023/A:1008670825910, MR 1635551.

External links[edit]