| Schläfli graph | |
| Vertices: | 27 |
| Edges: | 216 |
| Diameter: | 2 |
| Radius: | 2 |
| Girth: | 3 |
| Automorphisms: | 51840 |
| Chromatic Number: | 9 |
| Properties: | Strongly regular Claw-free Hamiltonian |
In the mathematical field of graph theory, the Schläfli graph, named after Ludwig Schläfli, is a 16-regular undirected graph with 27 vertices and 216 edges. It is a strongly regular graph with parameters srg(27, 16, 10, 8).
The intersection graph of the 27 lines on a cubic surface is a locally linear graph that is the complement of the Schläfli graph. That is, two vertices are adjacent in the Schläfli graph if and only if the corresponding pair of lines are skew.[1]
The Schläfli graph may also be constructed from the system of eight-dimensional vectors
(1, 0, 0, 0, 0, 0, 1, 0),
(1, 0, 0, 0, 0, 0, 0, 1), and
(-1/2, -1/2, 1/2, 1/2, 1/2, 1/2, 1/2, 1/2),and the 24 other vectors obtained by permuting the first six coordinates of these three vectors.These 27 vectors correspond to the vertices of the Schläfli graph; two vertices are adjacent if and only if the corresponding two vectors have 1 as their inner product.[2]
Alternately, this graph can be seen as the complement of the collinearity graph of the generalized quadrangle GQ(2, 4).
The neighborhood of any vertex in the Schläfli graph forms a 16-vertex subgraph in which each vertex has 10 neighbors (the numbers 16 and 10 coming from the parameters of the Schläfli graph as a strongly regular graph). These subgraphs are all isomorphic to the complement graph of the Clebsch graph.[1] [3] Since the Clebsch graph is triangle-free, the Schläfli graph is claw-free. It plays an important role in the structure theory for claw-free graphs by .
Any two skew lines of these 27 belong to a unique Schläfli double six configuration, a set of 12 lines whose intersection graph is a crown graph in which the two lines have disjoint neighborhoods. Correspondingly, in the Schläfli graph, each edge uv belongs uniquely to a subgraph in the form of a Cartesian product of complete graphs K6
\square
A graph is defined to be k-ultrahomogeneous if every isomorphism between two of its induced subgraphs of at most k vertices can be extended to an automorphism of the whole graph. If a graph is 5-ultrahomogeneous, it is ultrahomogeneous for every k; the only finite connected graphs of this type are complete graphs, Turán graphs, 3 × 3 rook's graphs, and the 5-cycle. The infinite Rado graph is countably ultrahomogeneous. There are only two connected graphs that are 4-ultrahomogeneous but not 5-ultrahomogeneous: the Schläfli graph and its complement. The proof relies on the classification of finite simple groups.[4]