𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a signless Laplacian spectral characterization of -shape trees

✍ Scribed by G.R. Omidi

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
193 KB
Volume
431
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Laplacian spectral radius of a tr
On the Laplacian spectral radius of a tree
✍ Ji-Ming Guo πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 84 KB

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 l

On the signless Laplacian spectral radiu
On the signless Laplacian spectral radius of graphs with cut vertices
✍ Bao-Xuan Zhu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 129 KB

In this paper, we show that among all the connected graphs with n vertices and k cut vertices, the maximal signless Laplacian spectral radius is attained uniquely at the graph G n,k , where G n,k is obtained from the complete graph K n-k by attaching paths of almost equal lengths to all vertices of