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

On the spectral radius of quasi-tree graphs

โœ Scribed by Huiqing Liu; Mei Lu

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

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the spectral radius of graphs
On the spectral radius of graphs
โœ Aimei Yu; Mei Lu; Feng Tian ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 190 KB
The Spectral Radius of Graphs on Surface
The Spectral Radius of Graphs on Surfaces
โœ M.N. Ellingham; Xiaoya Zha ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 152 KB

This paper provides new upper bounds on the spectral radius \ (largest eigenvalue of the adjacency matrix) of graphs embeddable on a given compact surface. Our method is to bound the maximum rowsum in a polynomial of the adjacency matrix, using simple consequences of Euler's formula. Let # denote th

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