Spreads in strongly regular graphs

Designs, Codes, and Cryptography

Volumn 8, Issue 1-2, 1996, Pages 145-157

  Haemers, Willem H ^a   Tonchev, Vladimir D ^b  

^a TILBURG UNIVERSITY   (Netherlands)

^b MICHIGAN TECHNOLOGICAL UNIVERSITY   (United States)

Author keywords

Graph colorings; Linked designs; Partial geometries; Regular 2 graphs; Spreads; Strongly regular graphs

Indexed keywords

EID: 0013528940     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00130574     Document Type: Article

References (23)

1. T. Beth, D. Jungnickel and H. Lenz, Design Theory, Cambridge Univ. Press (1985).
2. A. E. Brouwer, A. Cohen and A. Neumaier, Distance-Regular Graphs, Springer-Verlag, (1989).
3. F. C. Bussemaker, S. Čobeljić, D. M. Cvetković and J. J. Seidel, Computer investigations of cubic graphs, T.H.-Report 76-WSK-01, Techn. Univ. Eindhoven, (1976).
4. P. J. Cameron, On groups with several doubly-transitive permutation representations, Math. Z., Vol. 128 (1972) pp. 1-14.
5. P. J. Cameron and J. H. van Lint, Designs, Graphs, Codes and Their Links, Cambridge Univ. Press, (1991).
6. Yaotsu Chang, Imprimitive symmetric association schemes of rank 4, University of Michigan Ph.D. Thesis, (August 1994).
7. F. De Clerck, A. Del Fra and D. Ghinelli, Pointsets in partial geometries, in: Advances in Finite Geometries and Designs (J. W. P. Hirschfeld, D. R. Hughes and J. A. Thas eds.), Oxford Univ. Press (1991) pp. 93-110.
8. P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Research Reports Suppl., Vol. 10 (1973).
9. C. D. Godsil and A. D. Hensel, Distance regular covers of the complete graph, J. Combinatorial Theory B, Vol. 56 (1992) pp. 205-238.
10. J. M. Goethals and J. J. Seidel, The regular two-graph on 276 vertices, Discrete Math., Vol. 12 (1975) pp. 143-158.
11. W. H. Haemers, Eigenvalue techniques in design and graph theory, (Technical University Eindhoven, Ph.D. Thesis, 1979), Math. Centre Tract 121, Mathematical Centre, Amsterdam, 1980.
12. W. H. Haemers, Interlacing eigenvalues and graphs, Lin. Alg. Appl., Vol. 226-228 (1995) pp. 593-616.
13. W. H. Haemers, There exists no (76, 21, 2, 7) strongly regular graph, in: Finite Geometry and Combinatorics (F. De Clerck et al. eds.), Cambridge Univ. Press, (1993) pp. 175-176.
14. W. H. Haemers and D. G. Higman, Strongly regular graphs with strongly regular decomposition, Lin. Alg. Appl., Vol. 114/115 (1989) pp. 379-398.
15. 3, J. Combin. Theory A, Vol. 62 (1993) pp. 225-233.
16. A. J. Hoffman, On eigenvalues and colorings of graphs, in: Graph Theory and its Applications (B. Harris ed.), Acad. Press, New York (1970) pp. 79-91.
17. J. H. van Lint and R. Wilson, A Course in Combinatorics, Cambridge Univ. Press, (1992).
18. R. Mathon, The systems of linked 2-(16, 6, 2) designs, Ars Comb., Vol. 11 (1981) pp. 131-148.
19. R. Mathon and A. Rosa, Tables of parameters of BIBD's with r ≤ 41 including existence enumeration and resolvability results, Ann. Discrete Math., Vol. 26 (1985) pp. 275-308.
20. A. Neumaier, Strongly regular graphs with smallest eigenvalue -m, Archiv der Mathematik, Vol. 33 (1979) pp. 392-400.
21. S. E. Payne and J. A. Thas, Spreads and ovoids in finite generalized quadrangles, Geometriae Dedicata, Vol. 52 (1994) pp. 227-253.
22. E. Spence, Regular two-graphs on 36 vertices, Lin. Alg. Appl., Vol. 226-228 (1995) pp. 459-498.
23. D. E. Taylor, Regular two-graphs: Proc. London Math. Soc. Ser. 3, Vol. 35 (1977) pp. 257-274.