On the signless Laplacian spectral radius of irregular graphs
β Scribed by Ning, Wenjie; Li, Hao; Lu, Mei
- Book ID
- 122023443
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 254 KB
- Volume
- 438
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
By the signless Laplacian of a (simple) graph G we mean the matrix , where A(G), D(G) denote respectively the adjacency matrix and the diagonal matrix of vertex degrees of G. It is known that connected graphs G that maximize the signless Laplacian spectral radius Ο(Q (G)) over all connected graphs
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 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 Ξ±