The Strongly Regular $(45,12,3,3)$ Graphs

  • Kris Coolsaet
  • Jan Degraer
  • Edward Spence

Abstract

Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with parameters $v=45$, $k=12$, $\lambda=\mu=3$. It turns out that there are $78$ such graphs, having automorphism groups with sizes ranging from $1$ to $51840$.

Published
2006-04-04
How to Cite
Coolsaet, K., Degraer, J., & Spence, E. (2006). The Strongly Regular $(45,12,3,3)$ Graphs. The Electronic Journal of Combinatorics, 13(1), R32. https://doi.org/10.37236/1058
Article Number
R32