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.
Wikipage redirect
primaryTopic
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.
has abstract
In the mathematical field of g ...... ed the local McLaughlin graph.
@en
Le graphe de McLaughlin est, e ...... t 275 sommets et 15400 arêtes.
@fr
数学のグラフ理論の分野において、マクラフリングラフ（英: M ...... 、後者は局所マクラフリングラフと呼ばれる強正則グラフになる。
@ja
Link from a Wikipage to an external page
Wikipage page ID
46,573,575
page length (characters) of wiki page
Wikipage revision ID
852,405,208
Link from a Wikipage to another Wikipage
label
Graphe de McLaughlin
@fr
McLaughlin graph
@en
マクラフリングラフ
@ja
automorphisms
1,796,256,000
edges
name
McLaughlin graph
@en
vertices
wikiPageUsesTemplate
comment
In the mathematical field of g ...... the McLaughlin sporadic group.
@en
Le graphe de McLaughlin est, e ...... t 275 sommets et 15400 arêtes.
@fr
数学のグラフ理論の分野において、マクラフリングラフ（英: M ...... 、後者は局所マクラフリングラフと呼ばれる強正則グラフになる。
@ja