Bounds on the largest eigenvalues of trees with a given size of matching

Linear Algebra and Its Applications

Volumn 342, Issue 1-3, 2002, Pages 203-217

  Hou, Yaoping ^a   Li, Jiongsheng ^b  

^a HUNAN NORMAL UNIVERSITY   (China)

^b UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Matching; The largest eigenvalue of a graph; Tree; Upper bound

Indexed keywords

FORESTRY; TREES (MATHEMATICS);

LARGEST EIGENVALUES; MATCHING; MATCHINGS; TREE; UPPER BOUND;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 31244433843     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(01)00465-7     Document Type: Article

References (8)

1. Bondy, J.A., Murty, U.S.R., Graph Theory with Applications, 1976, Macmillan, New York.
2. An, C., Bounds on the second largest eigenvalue of a tree with perfect matchings. Linear Algebra Appl. 283 (1998), 247–255.
3. Cvetković D., Doob, M., Sachs, H., Spectra of Graphs, 1980, Academic Press, New York.
4. Cvetković D., Rowlinson, P., The largest eigenvalue of a graph: a survey. Linear and Multilinear Algebra 28 (1990), 3–33.
5. Hofmeister, M., On the two largest eigenvalues of trees. Linear Algebra Appl. 260 (1997), 43–59.
6. Li, Q., Feng, K.Q., On the largest of eigenvalues of graphs. Acta. Math. Appl. Sinica 2 (1979), 167–175 in Chinese.
7. Shao, J.Y., Y, Hong, Bounds on the smallest positive eigenvalue of trees with a perfect matching. Sci. Bull. 18 (1991), 1361–1364 in Chinese.
8. Xu, G.H., On the spectral radius of trees with perfect matchings. in: Combinatorics and Graph Theory, 1997, World Scientific, Singapore.