On the Laplacian spectral radius of a tree. (Q1399261): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:13, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Laplacian spectral radius of a tree. |
scientific article |
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
