Jump to content

Cameron graph: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
clean up, added orphan tag using AWB
Removed orphan tag (Added link in Strongly regular graph)
Line 1: Line 1:
{{Orphan|date=June 2015}}

{{Infobox graph
{{Infobox graph
| name = Cameron graph
| name = Cameron graph

Revision as of 09:26, 28 June 2015

Cameron graph
Vertices231
Edges3465
Radius2
Diameter2
Girth3
Automorphisms887040
PropertiesStrongly regular
Symmetric graph
Table of graphs and parameters

The Cameron graph is a strongly regular graph of parameters .