A prolific construction of strongly regular graphs with the n-e. c. property.
Cameron, Peter J. ; Stark, Dudley
The Electronic Journal of Combinatorics [electronic only], Tome DS10 (2002), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2002-01-01
EUDML-ID : urn:eudml:doc:122390 
@article{01803668,
     title = {A prolific construction of strongly regular graphs with the },
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {DS10},
     year = {2002},
     zbl = {1006.05065},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01803668}
}

Cameron, Peter J.; Stark, Dudley. A prolific construction of strongly regular graphs with the . The Electronic Journal of Combinatorics [electronic only], Tome DS10 (2002) . http://gdmltest.u-ga.fr/item/01803668/