Back to Search
Start Over
New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree.
- Source :
-
Linear Algebra & its Applications . Nov2013, Vol. 439 Issue 9, p2527-2541. 15p. - Publication Year :
- 2013
-
Abstract
- Abstract: This paper studies the problem of estimating the spectral radius of trees with the given number of vertices and maximum degree. We obtain the new upper bounds on the spectral radius of the trees, and the results are the best upper bounds expressed by the number of vertices and maximum degree, at present. Let be a tree on n vertices with maximum degree Δ, where . Denote by the spectral radius of T. We prove that [(1)] if , then , and equality holds if and only if T is an almost completely full-degree tree of 3 levels; [(2)] if , then , and equality holds if and only if T is a completely full-degree tree of 3 levels; [(3)] if , then , where . [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 439
- Issue :
- 9
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 90094921
- Full Text :
- https://doi.org/10.1016/j.laa.2013.07.026