𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Signless Laplacian Spectral Radius of Graphs with Given Number of Pendant Vertices

✍ Scribed by Yi-Zheng Fan; Dan Yang

Publisher
Springer Japan
Year
2009
Tongue
English
Weight
130 KB
Volume
25
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The minimum signless Laplacian spectral
The minimum signless Laplacian spectral radius of graphs with given independence number
✍ Ruilin Li; Jinsong Shi πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 307 KB

The independence number Ξ±(G) of G is defined as the maximum cardinality of a set of pairwise non-adjacent vertices which is called an independent set. In this paper, we characterize the graphs which have the minimum spectral radius among all the connected graphs of order n with independence number Ξ±

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

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