The spectral radius of trees on k pendant vertices

Linear Algebra and Its Applications

Volumn 395, Issue 1-3, 2005, Pages 343-349

  Wu, Baofeng ^a,b   Xiao, Enli ^b   Hong, Yuan ^b  

^a UNIVERSITY OF SHANGHAI FOR SCIENCE AND TECHNOLOGY   (China)

^b EAST CHINA NORMAL UNIVERSITY   (China)

Author keywords

Graph; Pendant vertex; Spectral radius; Tree

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; LINEAR ALGEBRA; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;

GRAPHS; PENDANT VERTEX; SPECTRAL RADIUS; TREE;

TREES (MATHEMATICS);

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

References (8)

1. A. Berman, R.S. Plemmons, Nonnegative Matrices in the Mathematical Sciences, Academic, 1979, SIAM, 1994.
2. Q. Li, K. Feng, On the largest eigenvalue of a graph, Acta Math. Appl. Sinica 2 (1979) 167-175 (in Chinese).
3. D. Cvetković, P. Rowlinson, S. Simić, Eigenspaces of Graphs, Cambridge University Press, Cambridge, 1997.
4. A.J. Schwenk, R.J. Wilson, On the eigenvalues of a graph, in: L.W. Beineke, R.J. Wilson (Eds.), Selected Topics in Graph Theory, Academic Press, New York, 1978, pp. 307-336.
5. A. Neumaier, The second largest eigenvalue of a tree, Linear Algebra Appl. 46 (1982) 9-25.
6. M. Hofmeister, On the two largest eigenvalues of trees, Linear Algebra Appl. 260 (1997) 46-59.
7. J.-M. Guo, S.-W. Tan, On the spectral radius of trees, Linear Algebra Appl. 329 (2001) 1-8.
8. G.H. Xu, On the spectral radius of trees with perfect matching, in: Combinatorics and Graph Theory, World Scientific, Singapore, 1997.