𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimum signless Laplacian spectral radius of graphs with given independence number

✍ Scribed by Ruilin Li; Jinsong Shi

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
307 KB
Volume
433
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

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 α(G) ∈ 1, 2, n 2 , n 2 + 1, n -2, n -3 .

πŸ“œ 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

The Laplacian spectral radius of bicycli
The Laplacian spectral radius of bicyclic graphs with a given girth
✍ Mingqing Zhai; Guanglong Yu; Jinlong Shu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 622 KB

Let B(n, g) be the class of bicyclic graphs on n vertices with girth g. Let B 1 (n, g) be the subclass of B(n, g) consisting of all bicyclic graphs with two edge-disjoint cycles and B 2 (n, g) = B(n, g) \ B 1 (n, g). This paper determines the unique graph with the maximal Laplacian spectral radius a