๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some results on Laplacian spectral radius of graphs with cut vertices

โœ Scribed by Xiaoling Zhang; Heping Zhang

Book ID
108114263
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
343 KB
Volume
310
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

The spectral radius of submatrices of La
The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices
โœ Jason J. Molitierno ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 326 KB

In [J. Molitierno, The spectral radius of submatrices of Laplacian matrices for trees and its comparison to the Fiedler vector, Linear Algebra Appl. 406 (2005) 253-271], we observed the effects on the spectral radius of submatrices of the Laplacian matrix L for a tree by deleting a row and column of