Cameron graph
≈ 2 min read
Names in other languages
- Italianografo di Cameron
- EnglishCameron graph
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
The Cameron graph is a strongly regular graph of parameters (231, 30, 9, 3) . 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. It can be obtained from a Steiner system S(3,6,22) (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. It is one of a small number of strongly regular graphs on which the Mathieu group acts as symmetries taking every vertex to every other vertex. The smaller graph is another.
The Cameron graph is a strongly regular graph of parameters (231, 30, 9, 3) . 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. It can be obtained from a Steiner system S(3,6,22) (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. It is one of a small number of strongly regular graphs on which the Mathieu group acts as symmetries taking every vertex to every other vertex. The smaller graph is another.
References
External links
A.E. Brouwer's website: the Cameron graph
Text derived from https://en.wikipedia.org/w/index.php?oldid=1295689662 under CC BY-SA 4.0; modifications have been made.