Higman–Sims graph
| Higman–Sims graph | |
|---|---|
 Drawing based on Paul R. Hafner's construction.[1] | |
| Named after | Donald G. Higman Charles C. Sims |
| Vertices | 100 |
| Edges | 1100 |
| Radius | 2 |
| Diameter | 2 |
| Girth | 4 |
| Automorphisms | 88,704,000 (HS:2) |
| Properties | Strongly regular Edge-transitive Hamiltonian Eulerian |
| Table of graphs and parameters | |
In mathematical graph theory, the Higman–Sims graph is a 22-regular undirected graph with 100 vertices and 1100 edges. It is the unique strongly regular graph srg(100,22,0,6), where no neighboring pair of vertices share a common neighbor and each non-neighboring pair of vertices share six common neighbors.[2] It was first constructed by (Mesner 1956) and rediscovered in 1968 by Donald G. Higman and Charles C. Sims as a way to define the Higman–Sims group, a subgroup of index two in the group of automorphisms of the Higman–Sims graph.[3]
Construction
From M22 graph
Take the M22 graph, a strongly regular graph srg(77,16,0,4) and augment it with 22 new vertices corresponding to the points of S(3,6,22), each block being connected to its points, and one additional vertex C connected to the 22 points.
From Hoffman–Singleton graph
There are 100 independent sets of size 15 in the Hoffman–Singleton graph. Create a new graph with 100 corresponding vertices, and connect vertices whose corresponding independent sets have exactly 0 or 8 elements in common. The resulting Higman–Sims graph can be partitioned into two copies of the Hoffman–Singleton graph in 352 ways.
From a cube
Take a cube with vertices labeled 000, 001, 010, ..., 111. Take all 70 possible 4-sets of vertices, and retain only the ones whose XOR evaluates to 000; there are 14 such 4-sets, corresponding to the 6 faces + 6 diagonal-rectangles + 2 parity tetrahedra. This is a 3-(8,4,1) block design on 8 points, with 14 blocks of block size 4, each point appearing in 7 blocks, each pair of points appearing 3 times, each triplet of points occurring exactly once. Permute the original 8 vertices any of 8! = 40320 ways, and discard duplicates. There are then 30 different ways to relabel the vertices (i.e., 30 different designs that are all isomorphic to each other by permutation of the points). This is because there are 1344 automorphisms, and 40320/1344 = 30.
Create a vertex for each of the 30 designs, and for each row of every design (there are 70 such rows in total, each row being a 4-set of 8 and appearing in 6 designs). Connect each design to its 14 rows. Connect disjoint designs to each other (each design is disjoint with 8 others). Connect rows to each other if they have exactly one element in common (there are 4x4 = 16 such neighbors). The resulting graph is the Higman–Sims graph. Rows are connected to 16 other rows and to 6 designs == degree 22. Designs are connected to 14 rows and 8 disjoint designs == degree 22. Thus all 100 vertices have degree 22 each.
Algebraic properties
The automorphism group of the Higman–Sims graph is a group of order 88,704,000 isomorphic to the semidirect product of the Higman–Sims group of order 44,352,000 with the cyclic group of order 2.[4] It has automorphisms that take any edge to any other edge, making the Higman–Sims graph an edge-transitive graph.[5]
The characteristic polynomial of the Higman–Sims graph is (x − 22)(x − 2)77(x + 8)22. Therefore, the Higman–Sims graph is an integral graph: its spectrum consists entirely of integers. It is also the only graph with this characteristic polynomial, making it a graph determined by its spectrum.
Inside the Leech lattice
The Higman–Sims graph naturally occurs inside the Leech lattice: if X, Y and Z are three points in the Leech lattice such that the distances XY, XZ and YZ are [math]\displaystyle{ 2, \sqrt{6}, \sqrt{6} }[/math] respectively, then there are exactly 100 Leech lattice points T such that all the distances XT, YT and ZT are equal to 2, and if we connect two such points T and T′ when the distance between them is [math]\displaystyle{ \sqrt{6} }[/math], the resulting graph is isomorphic to the Higman–Sims graph. Furthermore, the set of all automorphisms of the Leech lattice (that is, Euclidean congruences fixing it) which fix each of X, Y and Z is the Higman–Sims group (if we allow exchanging X and Y, the order 2 extension of all graph automorphisms is obtained). This shows that the Higman–Sims group occurs inside the Conway groups Co2 (with its order 2 extension) and Co3, and consequently also Co1.[6]
References
- ↑ Hafner, P. R. (2004). "On the Graphs of Hoffman–Singleton and Higman–Sims". the Electronic Journal of Combinatorics 11 (1): R77(1–32). doi:10.37236/1830. http://www.combinatorics.org/Volume_11/PDF/v11i1r77.pdf..
- ↑ Weisstein, Eric W.. "Higman–Sims Graph". http://mathworld.wolfram.com/Higman-SimsGraph.html.
- ↑ Higman, Donald G. (1968). "A simple group of order 44,352,000". Mathematische Zeitschrift 105 (2): 110–113. doi:10.1007/BF01110435. https://deepblue.lib.umich.edu/bitstream/2027.42/46258/1/209_2005_Article_BF01110435.pdf..
- ↑ Brouwer, Andries E.. "Higman–Sims graph". http://www.win.tue.nl/~aeb/drg/graphs/Higman-Sims.html.
- ↑ Brouwer, A. E. and Haemers, W. H. "The Gewirtz Graph: An Exercise in the Theory of Graph Spectra." Euro. J. Combin. 14, 397–407, 1993.
- ↑ Conway, John H.; Sloane, Neil J. A. (December 2010). Sphere Packings, Lattices and Groups. Grundlehren der mathematischen Wissenschaften (3rd ed.). Springer-Verlag. ISBN 978-1-4419-3134-4. chapter 10 (John H. Conway, "Three Lectures on Exceptional Groups"), §3.5 ("The Higman–Sims and McLaughlin groups"), pp. 292–293.
- Mesner, Dale Marsh (1956), An investigation of certain combinatorial properties of partially balanced incomplete block experimental designs and association schemes, with a detailed study of designs of Latin square and related types, Doctoral Thesis, Department of Statistics, Michigan State University
 |  |
