The Cameron graph is a strongly regular graph of parameters . This means that it has 231 vertices, 30 edges per vertex, 9 triangles per edges, and 3 two-edge paths between every two non-adjacent vertices.[1]
| Cameron graph | |
|---|---|
 | |
| Vertices | 231 |
| Edges | 3465 |
| Radius | 2 |
| Diameter | 2 |
| Girth | 3 |
| Automorphisms | 887040 |
| Properties | Strongly regular Symmetric graph |
| Table of graphs and parameters | |
It can be obtained from a Steiner system (a collection of 22 elements and 6-element blocks with each triple of elements covered by exactly one block). In this construction, the 231 vertices of the graph correspond to the 231 unordered pairs of elements. Two vertices are adjacent whenever they come from two disjoint pairs whose union belongs to one of the blocks.[1]
It is one of a small number of strongly regular graphs on which the Mathieu group M22 acts as symmetries taking every vertex to every other vertex. The smaller M22 graph is another.[2]
References
edit- ^ a b Brouwer, A. E. (1986), "Uniqueness and nonexistence of some graphs related to M22" (PDF), Graphs and Combinatorics, 2 (1): 21–29, doi:10.1007/BF01788073, MR 1117128
- ^ Crnković, Dean; Mostarac, Nina; Švob, Andrea (2021), Distance-regular graphs obtained from the Mathieu groups, arXiv:2101.02790
External links
edit
 | This graph theory-related article is a stub. You can help Wikipedia by expanding it. |