𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Laplacian spectral radius of a tree

✍ Scribed by Ji-Ming Guo

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
84 KB
Volume
368
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

Let G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its vertex degrees and its adjacency matrix. In this paper, we present a sharp upper bound for the Laplacian spectral radius of a tree in terms of the matching number and number of vertices, and deduce from that the largest few Laplacian spectral radii over the class of trees on a given number of vertices.

πŸ“œ SIMILAR VOLUMES

The Laplacian spectral radius of graphs
The Laplacian spectral radius of graphs on surfaces
✍ Liang Lin πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 89 KB

Let G be an n-vertex (n 3) simple graph embeddable on a surface of Euler genus Ξ³ (the number of crosscaps plus twice the number of handles). Denote by the maximum degree of G. In this paper, we first present two upper bounds on the Laplacian spectral radius of G as follows: (i) (ii) If G is 4-conn