Adjacency-matrix relation for a strongly regular graph (source code)

= Adjacency-matrix relation for a strongly regular graph

If a strongly regular graph on $n$ vertices has degree $d$, with $r$ common neighbours for adjacent vertices and $s$ for nonadjacent vertices, then its adjacency matrix satisfies
$$
A^2=(d-s)I+(r-s)A+sJ.
$$