Improved bounds for the largest eigenvalue of trees (Q2484400)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2189385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved bounds for the largest eigenvalue of trees |
scientific article; zbMATH DE number 2189385 |
Statements
Improved bounds for the largest eigenvalue of trees (English)
0 references
1 August 2005
0 references
Let \({\mathcal T}_{\Delta}\) be the set of all trees with maximum degree \(\Delta\). The reviewer in [Linear Algebra Appl. 360, 35--42 (2003; Zbl 1028.05062)] obtained upper bounds in terms of \(\Delta\) on the largest eigenvalues of the adjacency matrix and the Laplacian matrix of trees in \({\mathcal T}_{\Delta}\). In the paper under review, the author improves these bounds.
0 references
Laplacian matrix
0 references
adjacency matrix
0 references
0.9038941264152528
0 references
0.8588253259658813
0 references
0.8576962351799011
0 references
