𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Graphs with maximal signless Laplacian s
✍ Ting-Jung Chang; Bit-Shun Tam πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 340 KB

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

On the signless Laplacian spectral radiu
✍ 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 minimum signless Laplacian spectral
✍ 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 Ξ±