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

The spectral radius of a planar graph

โœ Scribed by Dasong Cao; Andrew Vince


Book ID
118347575
Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
438 KB
Volume
187
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the spectral radius of a directed gra
โœ Kwapisz, Jaroslaw ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 314 KB ๐Ÿ‘ 2 views

We provide upper estimates on the spectral radius of a directed graph. In particular w e prove that the spectral radius is bounded by the maximum of the geometric mean of in-degree and out-degree taken over all vertices.

On the spectral radius of graphs
โœ Aimei Yu; Mei Lu; Feng Tian ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 190 KB
The spectral radius of irregular graphs
โœ Lingsheng Shi ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 135 KB

Let ฮป 1 be the largest eigenvalue and ฮป n the least eigenvalue of the adjacency matrix of a connected graph G of order n. We prove that if G is irregular with diameter D, maximum degree ฮ”, minimum degree ฮด and average degree d, then . The inequality improves previous bounds of various authors and

The Spectral Radius of infinite Graphs
โœ Biggs, N. L.; Mohar, B.; Shawe-Taylor, J. ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Oxford University Press ๐ŸŒ English โš– 100 KB