A prolific construction of strongly regular graphs with the n-e.c. property

Electronic Journal of Combinatorics

Volumn 9, Issue 1 R, 2002, Pages 1-12

  Cameron, Peter J ^a   Stark, Dudley ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344526856     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1647     Document Type: Article

References (10)

1. Barbour, A. D., Holst, L. and Janson, S., Poisson Approximation, Oxford University Press, Oxford, 1992.
2. Bollobás, B., Random Graphs. Academic Press, London, 1985.
3. Bollobás, B. and Thomason, A. G., Graphs which contain all small graphs, Europ. J. Combinatorics, 2 (1981), 13-15.
4. Bonato, A., Holzmann, W. H., Kharaghani, H., Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property, Electronic J. Combinatorics, 8(1) (2001), #R1, 9pp.
5. Cameron, P. J., Goethals, J.-M., Seidel, J. J., Strongly regular graphs having strongly regular subconstituents, J. Algebra 55 (1978), 257-280.
6. Fon-Der-Flaass, D. G., New prolific constructions of strongly regular graphs. Preprint.
7. Glebskii, Y. V., Kogan, D. I., Liogon'kii, M. I. and Talanov, V. A., Range and degree of realizability of formulas in the restricted predicate calculus, Kibernetika 2 (1969),17-28.
8. Seidel, J. J., A survey of two-graphs, pp. 481-511 in Proc. Internat. Coll. Teorie Combinatorie (Roma 1973), Accad. Naz. Lincei, Roma, 1977.
9. Thomason, A. G., Pseudo-random graphs. Ann. Discrete Math. 33 (1987), 307-331.
10. Wallis, W. D., Construction of strongly regular graphs using affine designs. Bull. Austr. Math. Soc., 4 (1971), 41-49.