𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimum spectral radius of graphs with a given independence number

✍ Scribed by Mimi Xu; Yuan Hong; Jinlong Shu; Mingqing Zhai

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
221 KB
Volume
431
Category
Article
ISSN
0024-3795

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 independent domination number of
On the independent domination number of graphs with given minimum degree
✍ N.I. Glebov; A.V. Kostochka πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 175 KB

We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that of Haviland (1991) and settles the case 6 = 2 of the corresponding conjecture by Favaron (1988). @ 1998 Elsevier Science B.V. A