Spectral Extremal Graphs of Planar Graphs with Fixed Size
Liangdong Fan, Liying Kang, Jiadong Wu

TL;DR
This paper determines the spectral extremal graphs among outerplanar and planar graphs with a fixed number of edges, identifying specific structures that maximize spectral radius for large edge counts.
Contribution
It characterizes the spectral extremal graphs for outerplanar and planar graphs with fixed edges, extending previous results to new graph classes and fixed edge counts.
Findings
Maximum spectral radius for outerplanar graphs is achieved by a star when edges are large.
Spectral extremal planar graphs are identified as specific joins of smaller graphs for large edge counts.
Additional extremal graphs for paths, cycles, and complete graphs in these classes are also characterized.
Abstract
Tait and Tobin [J. Combin. Theory Ser. B 126 (2017) 137--161] determined the unique spectral extremal graph over all outerplanar graphs and the unique spectral extremal graph over all planar graphs when the number of vertices is sufficiently large. In this paper we consider the spectral extremal problems of outerplanar graphs and planar graphs with fixed number of edges. We prove that the outerplanar graph on edges with the maximum spectral radius is , where is a star with edges. For planar graphs with edges, our main result shows that the spectral extremal graph is when is odd and sufficiently large, and when is even and sufficiently large. Additionally, we obtain spectral extremal graphs for path, cycle and matching in outerplanar graphs and spectral extremal graphs for path,…
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.
Taxonomy
TopicsGraph theory and applications · Spectral Theory in Mathematical Physics · Finite Group Theory Research
