---
tag: FJP9RY0AG0
kind: concept
name: Cameron graph
sources:
  - wikipedia: en:47090773@r1295689662
    locator: Cameron graph
    note: adopted
    mention: wikipedia://en/47090773
    sections: [Summary]
same_as:
  wikidata: Q25303938
  wikipedia: Cameron graph
inventory: [16GC5REPCZ]
---

## Summary

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.