Enumeration of cospectral graphs

European Journal of Combinatorics

Volumn 25, Issue 2, 2004, Pages 199-211

  Haemers, Willem H ^a   Spence, Edward ^b  

^a TILBURG UNIVERSITY   (Netherlands)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

Eigenvalue; Enumeration; Graph

Indexed keywords

EID: 0742267980     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0195-6698(03)00100-8     Document Type: Article

References (8)

1. Cvetković D.M. Graphs and their spectra Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz. 354-356 1971 1-50
2. E.R. van Dam, Graphs with few eigenvalues; an interplay between combinatorics and algebra, Ph.D. Thesis, Tilburg University, Center for Economic Research Dissertation Series, No. 20, 1996
3. E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebra Appl. (in press)
4. GAP-Groups, Algorithms and Programming, Version 4.2, 2000
5. Godsil C.D. McKay B.D. Constructing cospectral graphs Aequationes Math. 25 1982 257-268
6. Johnson C.R. Newman M. A note on cospectral graphs J. Combin. Theory Ser. B 28 1980 96-103
7. Lepović M. Some statistical data on graphs with 10 vertices Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. 9 1998 79-88
8. J.H. van Lint, J.J. Seidel, Equilateral point sets in elliptic geometry, Proc. Nederl. Akad. Wetenschappen A 69 (1966) 335-348