Classification of regular two-graphs on 36 and 38 vertices

Australasian Journal of Combinatorics

Volumn 24, Issue , 2001, Pages 293-300

  McKay, Brendan D ^a   Spence, Edward ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

Classification; Regular two graph; Strongly regular graph

Indexed keywords

EID: 0141818749     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. A. E. Brouwer, Strongly Regular Graphs, in The CRC Handbook of Combinatorial Designs,(C.J. Colbourn and.1. H. Dinitz, Eds.) CRC Press 1996, pp. 670-673.
2. F. C. Bussemaker, W. H. Haemers, R. Mathon and H. Wilbrink, A (49,16,5,6) strongly regular graph does not exist, Europ. J. Combin., 18 (1989), 415-418.
3. F. C. Bussemaker, R. A. Mathon and I.I. Seidel, Tables of two-graphs, in CombinatoTic8 and Gmph TheoTY (S. B. Rao, Ed.), Lecture Notes in Mathematics, 885, Springer, 1982, pp. 70-112; Report 79-WSK-05, Tech. Univ. Eindhoven, 1979.
4. W. H. Haemers, Eigenvalue Techniques in Design and Graph Theory, Mathematical CentTe Tmcts 121, Mathematisch Centrum, Amsterdam, (1980).
5. B. D. McKay, autoson-a distributed batch system for UNIX workstation networks (version 1.3), Tech. Rpt. TR-CS-96-03, Dept. Computer Science, Austral. Nat. Univ., (1996).
6. R. Mathon, On self-complementary strongly regular graphs, Discrete Math., 69 (1988), 265-281.
7. B. D. McKay, Isomorph-free exhaustive generation, J. Algor'ithms, 26 (1998), 306-324.
8. E. Spence, Regular two-graphs on 36 vertices, Linear Algebra and its Applications 226-228; (1995), 459-497.
9. E. Spence, Two-Graphs, in The CRC Handbook of Combinatorial Designs, (C. J. Colbourn and J. H. Dinitz, Eds.) CRC Press 1996,686-694.