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

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, =

• Type: Journal
• Year: 2006
• Where: COMBINATORICS
• Authors: Kris Coolsaet, Jan Degraer, Edward Spence
• Keywords: Automorphism Groups, Backtrack Algorithms, COMBINATORICS 2006, Regular Graphs