Random strongly regular graphs?

Electronic Notes in Discrete Mathematics

Volumn 10, Issue , 2001, Pages 54-63

  Cameron, Peter J ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34247391120     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(04)00358-0     Document Type: Article

References (13)

1. B. Bollobás and A. G. Thomason, Graphs which contain all small graphs, Europ. J. Comb., 2 (1981), 13-15.
2. R. C. Bose, Strongly regular graphs, partial geometries, and partially balanced designs, Pacific J. Math. 13 (1963), 389-419.
3. W. Burnside, Theory of Groups of Finite Order, Dover Publ. (reprint), New York, 1955.
4. P. J. Cameron, Strongly regular graphs, in preparation.
5. P. J. Cameron and D. Stark, Strongly regular graphs with the n-e.c. property, in preparation.
6. D. G. Fon-Der-Flaass, New prolific constructions of strongly regular graphs, in preparation.
7. M. T. Jacobson and P. Matthews, Generating uniformly distributed random Latin squares, J. Combinatorial Design 4 (1996), 405-437.
8. B. D. McKay and E. Spence, in preparation.
9. A. Neumaier, Strongly regular graphs with least eigenvalue -m, Arch. Math. 33 (1979), 392-400.
10. 2 association scheme, Ann. Math. Statistics 30 (1959), 781-798.
11. W. D. Wallis, Construction of strongly regular graphs using affine designs, Bull. Austral. Math. Soc. 4 (1971), 41-49.
12. H. Wielandt, Permutation Groups through Invariant Relations and Invariant Functions, Ohio State Univ., Columbus, 1969.
13. R. M. Wilson, Non-isomorphic Steiner triple systems, Math. Z. 135 (1974), 303-313.