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

On the Laplacian spectral radius of trees with fixed diameter

โœ Scribed by Ji-Ming Guo

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
186 KB
Volume
419
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the spectral radius of trees with fix
On the spectral radius of trees with fixed diameter
โœ Ji-Ming Guo; Jia-Yu Shao ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 192 KB

Let T (n,d) be the set of trees on n vertices with diameter d. In this paper, the first d 2 + 1 spectral radii of trees in the set T (n,d) (3 d n -4) are characterized.

On the spectral radius of weighted trees
On the spectral radius of weighted trees with fixed diameter and weight set
โœ Shang-wang Tan; Yan-hong Yao ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 222 KB

The spectrum of weighted graphs are often used to solve the problems in the design of networks and electronic circuits. We first give some perturbational results on the spectral radius of weighted graphs when some weights of edges are modified, then we derive the weighted tree with the largest spect

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