Sciweavers

COMBINATORICS
2006
109views more  COMBINATORICS 2006»
13 years 5 months 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 ...
Kris Coolsaet, Jan Degraer, Edward Spence