The Search for Pseudo Orthogonal Latin Squares of Order Six

Designs, Codes, and Cryptography

Volumn 21, Issue 1-3, 2000, Pages 77-82

  Bussemaker, Frans C ^a   Haemers, Willem H ^b   Spence, Edward ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b TILBURG UNIVERSITY   (Netherlands)

^c UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

Computer search; Orthogonal Latin squares; Strongly regular graphs

Indexed keywords

EID: 0348003100     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1008379409579     Document Type: Article

References (13)

1. A. E. Brouwer, A. M. Cohen and A. Neumaier, Distance-Regular Graphs, Springer-Verlag, Berlin (1989).
2. F. C. Bussemaker, S. Ĉobeljić, D. M. Cvetković and J. J. Seidel, Computer investigations of cubic graphs, Report 76-WSK-01, Technical University Eindhoven (1976).
3. F. C. Bussemaker, W. H. Haemers, R. Mathon and H. A. Wilbrink, A (49, 16, 3, 6) strongly regular graph does not exist, Europ. J. Combinatorics, Vol. 10 (1989) pp. 413-418.
4. F. C. Bussemaker, R. Mathon and J. J. Seidel, Tables of two-graphs, Report 79-WSK-05, Technical University Eindhoven (1979).
5. D. M. Cvetković, M. Doob and H. Sachs, Spectra of Graphs - Theory and Application, VEB Deutscher Verlag der Wissenschaften, Berlin (1980).
6. E. R. van Dam, Regular graphs with four eigenvalues, Linear Algebra Appl., Vol. 226-228 (1995) pp. 139-162.
7. E. R. van Dam, Three-class association schemes, J. Alg. Combin., Vol. 10 (1999) pp. 69-107.
8. W. H. Haemers, Eigenvalue techniques in design and graph theory, Mathematical Centre Tract 121, Mathematical Centre, Amsterdam (1980).
9. W. H. Haemers, Interlacing eigenvalues and graphs, Linear Algebra Appl., Vol. 226-228 (1995) pp. 593-616.
10. W. H. Haemers and Vladimir D. Tonchev, Spreads in strongly regular graphs, Designs, Codes and Cryptography, Vol. 8 (1996) pp. 145-157.
11. A. J. Hoffman, On eigenvalues and colourings of graphs, Graph Theory and Its Applications (B. Harris, ed.), Academic Press, New York (1970) pp. 79-91.
12. B. McKay and E. Spence, private communication.
13. E. Spence, Regular two-graphs on 36 vertices, Linear Algebra Appl., Vol. 226-228 (1995) pp. 459-497.