๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The signless Laplacian spectral radius of tricyclic graphs and trees with k pendant vertices

โœ Scribed by Ke Li; Ligong Wang; Guopeng Zhao

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
610 KB
Volume
435
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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 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 ฮฑ