Title of article
On the largest eigenvalues of trees Original Research Article
Author/Authors
Xiang En Chen، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
9
From page
47
To page
55
Abstract
An upper bound for the largest eigenvalues of all but a few families of trees is given in this paper. This upper bound depends only on the vertex number of trees under consideration.
Keywords
Tree , Subtree , Characteristic polynomial , Largest eigenvalue
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948977
Link To Document