Cameron graph: Difference between revisions
From HandWiki
SpringEdit (talk | contribs) (over-write) |
(No difference)
|
Latest revision as of 16:25, 6 February 2024
Cameron graph | |
---|---|
![]() | |
Vertices | 231 |
Edges | 3465 |
Radius | 2 |
Diameter | 2 |
Girth | 3 |
Automorphisms | 887040 |
Properties | Strongly regular Symmetric graph |
Table of graphs and parameters |
The Cameron graph is a strongly regular graph of parameters [math]\displaystyle{ (231, 30, 9, 3) }[/math].
External links
![]() | Original source: https://en.wikipedia.org/wiki/Cameron graph.
Read more |