On the Laplacian spectral radius of a tree. (Q1399261)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the Laplacian spectral radius of a tree. |
scientific article; zbMATH DE number 1956813
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Laplacian spectral radius of a tree. |
scientific article; zbMATH DE number 1956813 |
Statements
On the Laplacian spectral radius of a tree. (English)
0 references
30 July 2003
0 references
The Laplacian matrix of a graph is the difference of the diagonal matrix of its vertex degrees and its adjacency matrix. The Laplacian spectral radius of a graph is the largest eigenvalue of its Laplacian matrix. This paper gives upper bounds on the Laplacian spectral radius of trees, in terms of the size of a maximum matching in it, and the number of vertices. In several cases, it is shown that the bounds are sharp.
0 references
matching number
0 references
retraction
0 references
Laplacian matrix
0 references
eigenvalue
0 references
0.8837371468544006
0 references
0.8821161389350891
0 references
0.8802922964096069
0 references
0.8791126012802124
0 references
0.8642271161079407
0 references
