The 231-Cameron graph is a strongly regular Hamiltonian graph on 231 vertices with parameters
. It is
distance-regular with intersection
array 
,
but is not distance-transitive.
It is named after mathematician Peter J. Cameron (Cameron et al. 1978).
It can be constructed by taking as vertices the 
unordered pairs from the point set of the Steiner
triple system 
and joining two vertices when the pairs are disjoint and their union is contained
in a block (Brouwer and van Lint 1984).
It has graph spectrum 
, and is therefore an integral
graph. It has graph automorphism group
order 
.
It is a Hamiltonian graph.
The 231-Cameron graph is implemented in the Wolfram Language as GraphData["CameronGraph"].
A different set of graphs associated with the name Cameron is the set of cubic planar Hamiltonian
graphs having exactly 3 Hamiltonian cycles
that were constructed by Kathleen Cameron (Cameron 2001; Knuth 2025, Problem 77).
The order-
planar cubic Cameron graph has 
vertices. The first few are illustrated above.
Since they are cubic and contain exactly 3 Hamiltonian cycles, they are automtatically perfectly
Hamiltonian. The 
and 
cases are Halin graphs. For 
, the graphs have exactly two graph
automorphisms (Knuth 2025).
For even 
,
each of the three Hamiltonian cycles gives a
bilaterally symmetric LCF embedding. "Nice"
LCF embeddings are shown above for 
to 5.
These graphs will be implemented in a future version of the Wolfram Language as GraphData[
"Cameron", n]
.
