Strongly regular graphs that are locally a disjoint union of hexagons

European Journal of Combinatorics

Volumn 18, Issue 5, 1997, Pages 579-588

  Peeters, René ^a  

^a TILBURG UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21744447624     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1996.0126     Document Type: Article

References (18)

1. T. Beth, D. Jungnickel and H. Lenz, Design Theory, Bibliographisches Institut, Zürich, 1985.
2. A. E. Brouwer and C. A. van Eijl, On the p-rank of the adjacency matrices of strongly regular graphs, J Alg. Combin., 1 (1992), 329-346.
3. A. E. Brouwer and J. H. van Lint, Strongly regular graphs and partial geometries, pp. 85-122 in: (D. M. Jackson and S. A. Vanstone (eds), Enumeration and Design - Proceedings of the Silver Jubilee Conference on Combinatorics, Waterloo, 1982, Academic Press, Toronto, 1984.
4. R. H. Bruck, Finite nets I. Numerical invariants, Can. J. Math., 3 (1951), 94-107.
5. R. H. Bruck, Finite nets II. Uniqueness and embedding, Pacific J. Math., 13 (1963), 421-457.
6. P. J. Cameron, Strongly regular graphs, in: L. W. Beineke and R. J. Wilson (eds), Selected Topics in Graph Theory, Academic Press, London, 1978, pp. 337-360.
7. P. J. Cameron and J. H. van Lint, Designs, Graphs, Codes and their Links, London Mathematical Society Student Texts 22, Cambridge, 1991.
8. J. Dénes and A. D. Keedwell, Latin Squares and Their Applications, Academic Press, New York, 1974.
9. C. D. Godsil and B. D. McKay, Constructing cospectral graphs, Aeq. Math., 25 (1982), 257-268.
10. W. H. Haemers, Eigenvalue Techniques in Design and Graph Theory, Math. Centre Tracts 121, Mathematisch Centrum, Amsterdam, 1980.
11. W. H. Haemers, Interlacing eigenvalues and graphs, Linear Algebra Applies, 227-228 (1995), 593-616.
12. W. H. Haemers, Distance-regularity and the spectrum of graphs, Linear Algebra Applies, 236 (1996), 265-278.
13. D. Jungnickel, On difference matrices and regular Latin squares, Abh. Math. Sem. Hamburg, 50 (1980), 219-231.
14. R. Mathon, The systems of linked (16, 6, 2) designs, Ars Combin. 11 (1981), 131-148.
15. S. E. Payne and J. A. Thas, Finite Generalized Quadrangles, Pitman, New York, 1985.
16. G. Pickert, Projektive Ebenen, 2nd edn, Springer-Verlag, Berlin, 1975.
17. J. J. Seidel, Strongly regular graphs, in: B. Bollobás (ed.), Surveys in Combinatorics, Proc. 7th British Combin. Conf., Lond. Math. Soc. Lect. Not. Ser., No. 38, Cambridge, 1979, pp. 157-180.
18. E. Spence, (40, 13, 4)-designs derived from strongly regular graphs, in: J. W. P. Hirschfeld, D. R. Hughes and J. A. Thas (eds), Advances in Finite Geometries and Designs, Proceedings of the Third Isle of Thorns Conference 1990, Oxford Science Publications, Oxford, 1991, pp. 359-368.