McLaughlin graph

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In the mathematical field of graph theory, the McLaughlin graph is a strongly regular graph with parameters (275, 112, 30, 56) and is the only such graph. The group theorist Jack McLaughlin discovered that the automorphism group of this graph had a subgroup of index 2 which was a previously undiscovered finite simple group, now called the McLaughlin sporadic group. The automorphism group has rank 3, meaning that its point stabilizer subgroup divides the remaining 274 vertices into two orbits. Those orbits contain 112 and 162 vertices. The former is the colinearity graph of the generalized quadrangle GQ(3,9). The latter is a strongly regular graph called the local McLaughlin graph.

In the mathematical field of graph theory, the McLaughlin graph is a strongly regular graph with parameters (275, 112, 30, 56) and is the only such graph. The group theorist Jack McLaughlin discovered that the automorphism group of this graph had a subgroup of index 2 which was a previously undiscovered finite simple group, now called the McLaughlin sporadic group. The automorphism group has rank 3, meaning that its point stabilizer subgroup divides the remaining 274 vertices into two orbits. Those orbits contain 112 and 162 vertices. The former is the colinearity graph of the generalized quadrangle GQ(3,9). The latter is a strongly regular graph called the local McLaughlin graph.

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1220127843 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.