A sufficient condition for a family of graphs being determined by their generalized spectra

European Journal of Combinatorics

Volumn 27, Issue 6, 2006, Pages 826-840

  Wang, Wei ^a   Xu, Cheng xian ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646099821     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2005.05.004     Document Type: Article

References (14)

1. Cohen H. A Course in Computational Algebraic Number Theory (1996), Springer, New York
2. Cvetković D.M., Doob M., and Sachs H. Spectra of Graphs (1982), Academic Press, New York
3. Cvetković D.M., Doob M., Gutman I., and Torgašev A. Recent Results in the Theory of Graphs Spectra. Annals of Discrete Mathematics vol. 36 (1988), North-Holland, Amsterdam
4. Collatz L., and Sinogowitz U. Spektren endlicher Grafen. Abh. Math. Sem. Univ. Hamburg 21 (1957) 63-77
5. van Dam E.R., and Haemers W.H. Which graphs are determined by their spectrum?. Linear Algebra Appl. 373 (2003) 241-272
6. Doob M., and Haemers W.H. The complement of the path is determined by its spectrum. Linear Algebra Appl. 356 (2002) 57-65
7. Godsil C.D., and McKay B.D. Some computational results on the spectra of graphs. Combinatorial Mathematics IV. Lecture Notes in Mathematics vol. 560 (1976), Springer-Verlag, Berlin 73-92
8. Godsil C.D. Algebraic Comb. (1993), Chapman & Hall
9. Haemers W.H., and Spence E. Enumeration of cospectral graphs. European J. Combin. 25 (2004) 199-211
10. Hagos E.M. Some results on graph spectra. Linear Algebra Appl. 356 (2002) 103-111
11. Lepović M., and Gutman I. No starlike trees are cospectral. Discrete Math. 242 (2002) 291-295
12. McKay B.D. On the spectral characterization of trees. Ars Combin. 3 (1979) 219-232
13. Schwenk A.J. Almost all trees are cospectral. In: Harary F. (Ed). New Directions in the Theory of Graphs (1973), Academic Press, New York 275-307
14. Seress A. Large families of cospectral graphs. Des. Codes Cryptogr. 21 (2000) 205-208