The Pseudo-geometric Graphs for Generalized Quadrangles of Order (3, t)

European Journal of Combinatorics

Volumn 22, Issue 6, 2001, Pages 839-845

  Haemers, Willem H ^a   Spence, Edward ^b  

^a TILBURG UNIVERSITY   (Netherlands)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (10)

1. A. E. Brouwer, Strongly regular graphs, in: The CRC Handbook of Combinatorial Designs, C. J. Colbourn and J. H. Dinitz (eds), CRC Press, Boca Raton, FL, 1996, pp. 670-673.
2. P. J. Cameron, J.-M. Goethals and J. J. Seidel, Strongly regular graphs having strongly regular sub-constituents, J. Algebra, 55 (1978), 257-280.
3. W. H. Haemers, Eigenvalue techniques in design and graph theory. Mathematical Centre Tracts, 121, Mathematisch Centrum, Amsterdam, 1980.
4. W. H. Haemers, There exists no (71, 21, 2, 7) strongly regular graph, in: Finite Geometry and Combinatorics, F. De Clerk et al. (eds), Cambridge University Press, Cambridge, U.K., 1993, pp. 175-176.
5. W. H. Haemers, Interlacing eigenvalues and graphs, Linear Algebr. Appl., 226-228 (1995), 593-616.
6. R. Mathon, The system of linked 2-(16, 6, 2) designs, Ars. Comb., 11 (1981), 131-148.
7. S. E. Payne and J. A. Thas, Finite Generalized Quadrangles, Pitman, New York, 1984.
8. R. Peeters, Strongly regular graphs that are locally a disjoint union of hexagons, Europ. J. Combinatorics, 18 (1997), 579-588.
9. 2 association scheme, Ann. Math. Stat., 30 (1959), 781-798.
10. E. Spence, The strongly regular (40, 12, 2, 4) graphs, Elec. J. Comb., 7 (2000), R22.