Spectral radius of finite and infinite planar graphs and of graphs of bounded genus
Zdenek Dvorak, Bojan Mohar

TL;DR
This paper establishes bounds on the spectral radius of finite and infinite planar graphs and graphs of bounded genus, extending known results for trees and solving an open problem, with applications to hyperbolic tessellations.
Contribution
It derives new bounds for the spectral radius of planar and bounded genus graphs, improves previous results, and introduces a graph decomposition method for hyperbolic tessellations.
Findings
Spectral radius bounds for planar graphs with maximum degree D
Construction of infinite planar graphs reaching the upper bound
Enhanced bounds for hyperbolic tessellations
Abstract
It is well known that the spectral radius of a tree whose maximum degree is cannot exceed . In this paper we derive similar bounds for arbitrary planar graphs and for graphs of bounded genus. It is proved that a the spectral radius of a planar graph of maximum vertex degree satisfies . This result is best possible up to the additive constant--we construct an (infinite) planar graph of maximum degree , whose spectral radius is . This generalizes and improves several previous results and solves an open problem proposed by Tom Hayes. Similar bounds are derived for graphs of bounded genus. For every , these bounds can be improved by excluding as a subgraph. In particular, the upper bound is strengthened for 5-connected graphs. All our results hold for finite as well as for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
