# Cores of strongly regular graphs

\begin{question} Does every \Def{strongly regular graph} have either itself or a complete graph as a \Def[core]{core (graph theory)}? \end{question}

If true, this curious question indicates a very interesting property of strongly regular graphs. While on the surface, there would appear to be no particular reason for it to hold, it has already been verified for a number of interesting classes of graphs. Cameron and Kazanidis [CK] showed that it holds for rank-3 graphs, while Godsil and Royle [GR] have showed that it holds for point graphs of generalized quadrangles, block graphs of Steiner systems and orthogonal arrays with sufficiently many points, and for all strongly regular graphs on at most 36 vertices.

## Bibliography

*[CK] P. J. Cameron and P. A. Kazanidis, Cores of symmetric graphs, J. Australian Math. Soc., to appear.

[GR] C. Godsil and G.F. Royle, \href[Cores of Geometric Graphs]{http://xxx.tau.ac.il/pdf/0806.1300v1}

* indicates original appearance(s) of problem.

## Correction

I believe you mean "Godsil and Royle", not "Gordon and Royle".