Sciweavers

Share
COMBINATORICS
2006

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

9 years 3 days ago
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, =
Kris Coolsaet, Jan Degraer, Edward Spence
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where COMBINATORICS
Authors Kris Coolsaet, Jan Degraer, Edward Spence
Comments (0)
books