Commit 2023-08-01 12:02 c8214aaa

feat: parameter equality of strongly regular graphs (#6060) i.e. $k(k-l-1)=(n-k-1)μ$. An extra condition $n>0$ is required because the proof (a standard double counting argument) sets itself around an arbitrary vertex of the graph, and furthermore the null graph ($n=0$) can vacuously be made to be strongly regular with any parameters you like.