Title of article
Bounds on the largest eigenvalues of trees with a given size of matching Original Research Article
Author/Authors
Yaoping Hou، نويسنده , , Jiongsheng Li، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
15
From page
203
To page
217
Abstract
Very little is known about upper bound for the largest eigenvalue of a tree with a given size of matching. In this paper, we find some upper bounds for the largest eigenvalue of a tree in terms of the number of vertices and the size of matchings, which improve some known results.
Keywords
The largest eigenvalue of a graph , upper bound , Matching , Tree
Journal title
Linear Algebra and its Applications
Serial Year
2002
Journal title
Linear Algebra and its Applications
Record number
823467
Link To Document