The strongly regular (45, 12, 3, 3) graphs

Electronic Journal of Combinatorics

Volumn 13, Issue 1 R, 2006, Pages 1-9

  Coolsaet, Kris ^a   Degraer, Jan ^a   Spence, Edward ^b  

^a GHENT UNIVERSITY   (Belgium)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33645695025     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1058     Document Type: Article

References (12)

1. A. E. BROUWER, A. M. COHEN and A. NEUMAIER, Distance-Regular Graphs, Ergeb. Math. Grenzgeb. (3) 18, Springer-Verlag, Berlin (1989).
2. A. E. BROUWER, Strongly Regular Graphs, in The CRC Handbook of Combinatorial Designs, (C.J. Colbourn, J.H. Dinitz; eds), CRC Press, New York, (1996), 667-685,
3. J. DEGRAER, K. COOLSAET, Classification of three-class association schemes using backtracking with dynamic variable ordering, Discrete Mathematics, 300(1-3) (2005), 71-81.
4. J. DEGRAER, K. COOLSAET, Classification of some strongly regular subgraphs of the McLaughlin graph, to appear in Discrete Mathematics.
5. W. H. HAEMERS, Eigenvalue Techniques in Design and Graph Theory, Mathematical Centre Tracts 121, Mathematisch Centrum, Amsterdam, (1980).
6. W. H. HAEMERS, E. SPENCE, The Pseudo-Geometric Graphs for Generalized Quadrangles of order (3,t), European J. Combin., 22(6) (2001), 839-845.
7. R. MATHON, E. SPENCE, On 2-(45, 12, 3) designs, Journal of Combinatorial Designs, 4(3) (1996), 155-177.
8. B. D. MCKAY, Practical Graph Isomorphism, Congressus Numerantium, 30 (1981), 45-87.
9. B. D. MCKAY, Nauty user's guide (version 1.5), Technical Report TR-CS-90-02, Computer Science Department, Australian National University, (1990).
10. B. D. MCKAY, E. SPENCE, The Classification of Regular Two-Graphs on 36 and 38 Vertices, Australas. J. Combin., 24 (2001), 293-300.
11. E. SPENCE, The Strongly Regular (40, 12, 2, 4) Graphs, Elec. Journ. Combin. 7(1), (2000).
12. E. SPENCE, Strongly Regular Graphs, URL: http://www.maths.gla.ac.uk/~es/ srgraphs.html, (2004).