On the maximum spectral radius of planar graphs
Abstract
This paper investigates the maximum spectral radius of planar graphs with concrete fixed number of vertices, providing some tight bounds on the maximum spectral radius of general planar graph resorting to its order, and confirming that among all planar graphs containing dominating vertex with concrete fixed order n ≥ 48, the join of P2 and Pn-2 attains the maximum spectral radius.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.