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

Distance spectral radius of graphs with pendent vertices

โœ Scribed by Surya Sekhar Bose; Milan Nath; Somnath Paul

Book ID
113771944
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
256 KB
Volume
435
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the nullity of graphs with pendent ve
On the nullity of graphs with pendent vertices
โœ Shuchao Li ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 188 KB

The nullity of a graph G, denoted by ฮท(G), is the multiplicity of the eigenvalue zero in its spectrum. Cheng and Liu [B. Cheng, B. Liu, On the nullity of graphs, Electron. J. Linear Algebra 16 (2007) 60-67] characterized the extremal graphs attaining the upper bound n -2 and the second upper bound n

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