An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra

Linear Algebra and Its Applications

Volumn 418, Issue 1, 2006, Pages 62-74

  Wang, Wei ^a   Xu, Cheng Xian ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Cospectral graphs; Main eigenvalues; Spectra of graphs

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; NUMERICAL METHODS; PROBLEM SOLVING; THEOREM PROVING;

COSPECTRAL GRAPHS; MAIN EIGENVALUES; SPECTRA OF GRAPHS;

GRAPH THEORY;

EID: 33747830267     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2006.01.016     Document Type: Article

References (7)

1. Brualdi R.A., and Ryser H.J. Combinatorial Matrix Theory (1991), Cambridge University Press, Cambridge
2. Cohen H. A Course in Computational Algebraic Number Theory (1996), Springer, Berlin
3. Cvetković D.M., Doob M., and Sachs H. Spectra of Graphs (1982), Academic Press, New York
4. van Dam E.R., and Haemers W.H. Which graphs are determined by their spectrum?. Linear Algebra Appl. 373 (2003) 241-272
5. Liebeck H., and Osborne A.D. The generation of all rational orthogonal matrices. Amer. Math. Monthly 98 (1991) 131-133
6. Reingold E.M., Nievergelt J., and Deo N. Combinatorial Algorithms: Theory and Practice (1977), Princeton-Hall, Inc., Englewood Cliffs, NJ
7. W. Wang, C.X. Xu, A sufficient condition for a family of graphs being determined by their generalized spectra, European J. Combin., to appear.