Английская Википедия:Hoffman–Singleton graph
Шаблон:Short description Шаблон:Infobox graph
In the mathematical field of graph theory, the Hoffman–Singleton graph is a 7-regular undirected graph with 50 vertices and 175 edges. It is the unique strongly regular graph with parameters (50,7,0,1).[1] It was constructed by Alan Hoffman and Robert Singleton while trying to classify all Moore graphs, and is the highest-order Moore graph known to exist.[2] Since it is a Moore graph where each vertex has degree 7, and the girth is 5, it is a (7,5)-cage.
Construction
Here are some constructions of the Hoffman–Singleton graph.[3]
Construction from pentagons and pentagrams
Take five pentagons Ph and five pentagrams Qi . Join vertex j of Ph to vertex h·i+j of Qi. (All indices are modulo 5.)[3]
Construction from PG(3,2)
Take a Fano plane on seven elements, such as {abc, ade, afg, bef, bdg, cdf, ceg} and apply all 2520 even permutations on the 7-set abcdefg. Canonicalize each such Fano plane (e.g. by reducing to lexicographic order) and discard duplicates. Exactly 15 Fano planes remain. Each 3-set (triplet) of the set abcdefg is present in exactly 3 Fano planes. The incidence between the 35 triplets and 15 Fano planes induces PG(3,2), with 15 points and 35 lines. To make the Hoffman-Singleton graph, create a graph vertex for each of the 15 Fano planes and 35 triplets. Connect each Fano plane to its 7 triplets, like a Levi graph, and also connect disjoint triplets to each other like the odd graph O(4).
A very similar construction from PG(3,2) is used to build the Higman–Sims graph, which has the Hoffman-Singleton graph as a subgraph.
Construction on a groupoid/magma
Let <math>G</math> be the set <math>\mathbb{Z}_2\times \mathbb{Z}_5\times\mathbb{Z}_5</math>. Define a binary operation <math>\circ</math> on <math>G</math> such that for each <math>(a,b,c)</math> and <math>(x,y,z)</math> in <math>G</math>, <math>(a,b,c)\circ(x,y,z)=(a+x,b-bx+y,c+(-1)^a by+2^az)</math>. Then the Hoffman-Singleton graph has vertices <math>g \in G</math> and that there exists an edge between <math>g \in G</math> and <math>g'\in G</math> whenever <math>g'=g\circ s</math> for some <math>s \in \{(0,0,1),(0,0,4),(1,0,0),(1,1,0),(1,2,0),(1,3,0),(1,4,0)\}</math>. [4] (Although the authors use the word "groupoid", it is in the sense of a binary function or magma, not in the category-theoretic sense. Also note there is a typo in the formula in the paper: the paper has <math>(-1)^x by</math> in the last term, but that does not produce the Hoffman-Singleton graph. It should instead be <math>(-1)^a by </math> as written here.[5])
Algebraic properties
The automorphism group of the Hoffman–Singleton graph is a group of order 252 000 isomorphic to PΣU(3,52) the semidirect product of the projective special unitary group PSU(3,52) with the cyclic group of order 2 generated by the Frobenius automorphism. It acts transitively on the vertices, on the edges and on the arcs of the graph. Therefore, the Hoffman–Singleton graph is a symmetric graph. As a permutation group on 50 symbols, it can be generated by the following two permutations applied recursively[6] <math> (1\ 44\ 22\ 49\ 17\ 43\ 9\ 46\ 40\ 45)
(2\ 23\ 24\ 14\ 18\ 10\ 12\ 42\ 38\ 6)
(3\ 41\ 19\ 4\ 15\ 20\ 7\ 13\ 37\ 8)
(5\ 28\ 21\ 29\ 16\ 25\ 11\ 26\ 39\ 30)
(27\ 47)
(31\ 36\ 34\ 32\ 35)
(33\ 50) </math>
and
<math> (1\ 7\ 48\ 47\ 41\ 46\ 17)
(2\ 39\ 11\ 4\ 15\ 14\ 42)
(3\ 32\ 28\ 9\ 23\ 6\ 43)
(5\ 22\ 38\ 18\ 44\ 36\ 29)
(8\ 37\ 40\ 34\ 26\ 49\ 24)
(10\ 16\ 31\ 27\ 13\ 21\ 45)
(19\ 33\ 25\ 35\ 50\ 30\ 20) </math>
The stabilizer of a vertex of the graph is isomorphic to the symmetric group S7 on 7 letters. The setwise stabilizer of an edge is isomorphic to Aut(A6)=A6.22, where A6 is the alternating group on 6 letters. Both of the two types of stabilizers are maximal subgroups of the whole automorphism group of the Hoffman–Singleton graph.
The characteristic polynomial of the Hoffman–Singleton graph is equal to <math>(x-7) (x-2)^{28} (x+3)^{21}</math>. Therefore, the Hoffman–Singleton graph is an integral graph: its spectrum consists entirely of integers.
The Hoffman-Singleton graph has exactly 100 independent sets of size 15 each. Each independent set is disjoint from exactly 7 other independent sets. The 100-vertex graph that connects disjoint independent sets can be partitioned into two 50-vertex subgraphs, each of which is isomorphic to the Hoffman-Singleton graph, in an unusual case of self-replicating + multiplying behavior.
Subgraphs and supergraphs
There are 1260 5-cycles and 525 6-cycles in the Hoffman–Singleton graph. There are 525 copies of the Petersen graph, with each 6-cycle belonging to exactly one Petersen each. Removing any one Petersen leaves a copy of the unique (6,5) cage.[7]
The Hoffman–Singleton graph also contains many copies of the Möbius–Kantor graph and the Heawood graph, which are all bipartite, and by coloring them with alternating values of +1 and -1, an eigenvector of the graph can be found, with associated eigenvalue of −3. (This the only negative eigenvalue of the Hoffman–Singleton graph.) Taken together, these eigenvectors span the −3 eigenspace of the Hoffman–Singleton graph, although they form a highly overcomplete basis: there are many more Möbius–Kantor graphs or Heawood graphs than there are −3 eigenvectors. There are 750 copies of the Heawood graph, and the Heawood graph has automorphism group of order 336. In turn, 750*336 = 252000, the size of the automorphism group of the Hoffman-Singleton graph, which means that the Hoffman-Singleton graph is fixed by fixing any Heawood graph inside of it. Similarly, there are 2625 copies of the Möbius–Kantor graph, which has automorphism group order 96, and 2625*96=252000, so the analogous statement holds.
The Heawood graph is notably the incidence graph of the Fano plane, and so following the 15+35 construction of the Hoffman–Singleton graph above, this immediately shows many places where Heawood graphs must occur. Take an independent set of size 15 in the Hoffman Singleton graph. There are 100 of these. Find another independent set that has 8 vertices in common with the first. There are 15 such neighboring independent sets. Discard the 8 common vertices. The 14 vertices that remain form a Heawood graph. There are thus 100*15/2 = 750 Heawood graphs as established earlier.
The Hoffman Singleton graph also contains the odd graph O(4), the Coxeter graph, and the Tutte-Coxeter graph as subgraphs.
Take any edge of the Hoffman-Singleton graph, and discard those two vertices as well as the 12 vertices directly connected to either of them. The graph that remains is the Sylvester graph on 36 vertices. Because each such edge can be mapped to a distinct Sylvester graph, there are 175 copies of the Sylvester graph in the Hoffman Singleton graph.
The Hoffman Singleton graph is contained in the Higman–Sims graph which is therefore a supergraph.
The Hoffman-Singleton graph contains 42000 copies of the dodecahedral graph as a subgraph.
See also
- McKay–Miller–Širáň graphs, a class of graphs including the Hoffman–Singleton graph
- Table of the largest known graphs of a given diameter and maximal degree
Notes
References
- ↑ Шаблон:Citation.
- ↑ Шаблон:Citation.
- ↑ 3,0 3,1 Шаблон:Citation
- ↑ Шаблон:Cite arXiv
- ↑ Шаблон:Citation
- ↑ These generators published by GAP. There are of course many other generators for this group.
- ↑ Шаблон:Cite journal
