118
click to vote
COMBINATORICS
2000
15 years 2 months ago
2000
In a previous paper it was established that there are at least 27 non-isomorphic strongly regular (40, 12, 2, 4) graphs. Using a different and more efficient method we have re-inv...
DM
2008
15 years 2 months ago
2008
By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, ,