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

Sharp bounds on the signless laplacian spectral radii of graphs

โœ Scribed by Guanglong Yu; Yarong Wu; Jinlong Shu

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
192 KB
Volume
434
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Signless Laplacian spectral radii of gra
Signless Laplacian spectral radii of graphs with given chromatic number
โœ Guanglong Yu; Yarong Wu; Jinlong Shu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 263 KB

Let G be a simple graph with vertices v 1 , v 2 , . . . , v n , of degrees = ) is called the signless Laplacian spectral radius or Q -spectral radius of G. Denote by ฯ‡(G) the chromatic number for a graph G. In this paper, for graphs with order n, the extremal graphs with both the given chromatic num

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