Let G be a simple graph with n vertices and orientable genus g and non-orientable genus h. Let \(G) be the spectral radius of the adjacency matrix A of G. We obtain the following sharp bounds of \(G): (1) \(G) 1+-3n+12g&8; (2) \(G) 1+-3n+6h&8.
✦ LIBER ✦
Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract)
✍ Scribed by Zdeněk Dvořák; Bojan Mohar
- Book ID
- 108120702
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 200 KB
- Volume
- 34
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Upper Bounds of the Spectral Radius of G
✍
Hong Yuan
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 149 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
Spectral radius and Hamiltonicity of gra
✍
Miroslav Fiedler; Vladimir Nikiforov
📂
Article
📅
2010
🏛
Elsevier Science
🌐
English
⚖ 91 KB
Let G be a graph of order n and μ(G) be the largest eigenvalue of its adjacency matrix. Let G be the complement of G. Write K n-1 + v for the complete graph on n -1 vertices together with an isolated vertex, and K n-1 + e for the complete graph on n -1 vertices with a pendent edge. We show that:
Sharp upper and lower bounds for the Lap
✍
Ji-ming Guo
📂
Article
📅
2008
🏛
Institute of Applied Mathematics, Chinese Academy
🌐
English
⚖ 153 KB
Walks and the spectral radius of graphs
✍
Vladimir Nikiforov
📂
Article
📅
2006
🏛
Elsevier Science
🌐
English
⚖ 161 KB
Spectral radius and Hamiltonian properti
✍
Ning, Bo; Ge, Jun
📂
Article
📅
2014
🏛
Taylor and Francis Group
🌐
English
⚖ 164 KB