𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Laplacian spectral radius of trees with given maximum degree

✍ Scribed by Aimei Yu; Mei Lu

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
140 KB
Volume
429
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

On the Laplacian spectral radius of a tr
On the Laplacian spectral radius of a tree
✍ Ji-Ming Guo πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 84 KB

Let G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its vertex degrees and its adjacency matrix. In this paper, we present a sharp upper bound for the Laplacian spectral radius of a tree in terms of the matching number and number of vertices, and deduce from that the l

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 Ξ±