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.
โฆ LIBER โฆ
Minimum spectral radius of a weighted graph
โ Scribed by Svatopluk Poljak
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 582 KB
- Volume
- 171
- 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
A bound on the spectral radius of graphs
โ
Hong Yuan
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 238 KB
The Spectral Radius of Graphs on Surface
โ
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
An extremal problem for the spectral rad
โ
Miroslav Fiedler
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 519 KB
A Sharp Upper Bound of the Spectral Radi
โ
Yuan Hong; Jin-Long Shu; Kunfu Fang
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 88 KB
On the Spectral Radius and the Genus of
โ
H. Yuan
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 205 KB
In this paper, we obtain a relation between the spectral radius and the genus of a graph. In particular, we give upper bounds on the spectral radius of graphs with \(n\) vertices and small genus. " " 1995 Academic Press. Ins