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 α
The Laplacian spectral radius for unicyclic graphs with given independence number
✍ Scribed by Lihua Feng; Guihai Yu; Aleksandar Ilić
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 390 KB
- Volume
- 433
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
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