Ordering trees by their largest eigenvalues

Linear Algebra and Its Applications

Volumn 370, Issue SUPP, 2003, Pages 175-184

  Chang, An ^a   Huang, Qiongxiang ^b  

^a FUZHOU UNIVERSITY   (China)

^b XINJIANG UNIVERSITY   (China)

Author keywords

Characteristic polynomial; Eigenvalue; Tree; Upper bound

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; LINEAR ALGEBRA; POLYNOMIALS;

REAL SYMMETRIC MATRIX;

TREES (MATHEMATICS);

EID: 0038638347     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(03)00384-7     Document Type: Article

References (9)

1. Hofmeister M. On the two largest eigenvalues of trees. Linear Algebra Appl. 260:1997;43-59.
2. Neumaier A. The second largest eigenvalue of a tree. Linear Algebra Appl. 46:1982;9-25.
3. Shao J.Y. Bounds on the. k th eigenvalues of trees and forests Linear Algebra Appl. 149:1991;19-34.
4. Li Q., Feng K.Q. On the largest eigenvalue of graphs. Acta Math. Appl. Sinica. 2:1979;167-175. in Chinese.
5. D. Cvetković, Some possible directions in further investigations of graph spectra, in: Algebra Methods in Graph Theory, vol. 1, North-Holland, Amsterdam, 1981, pp. 47-67.
6. G.H. Xu, On the spectral radius of trees with perfect matchings, in: Combinatorics and Graph Theory, World Scientific, Singapore, 1997.
7. Guo J.M., Tan S.W. On the spectral radius of trees. Linear Algebra Appl. 329:2001;1-8.
8. Cvetković D., Doob M., Sachs H. Spectra of Graph - Theory and Applications. 1980;Academic Press, New York.
9. An Chang, On the largest eigenvalue of a tree with perfect matchings, Discrete Mathematics, in press.