𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The smallest Laplacian spectral radius of graphs with a given clique number

✍ Scribed by Ji-Ming Guo; Jianxi Li; Wai Chee Shiu

Book ID
113772352
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
660 KB
Volume
437
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 Ξ±

The Laplacian spectral radius of bicycli
The Laplacian spectral radius of bicyclic graphs with a given girth
✍ Mingqing Zhai; Guanglong Yu; Jinlong Shu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 622 KB

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