Sciweavers

COMBINATORICS
2000
82views more  COMBINATORICS 2000»
14 years 8 days ago
The Strongly Regular (40, 12, 2, 4) Graphs
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...
Edward Spence
DM
2008
62views more  DM 2008»
14 years 15 days ago
Classification of some strongly regular subgraphs of the McLaughlin graph
By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, ,
Jan Degraer, Kris Coolsaet