On the maximum spectral radius of connected graphs with a prescribed order and size
Abstract
The spectral radius of a graph is the largest modulus of an eigenvalue of its adjacency matrix. Let Cn, e be the set of all the connected simple graphs with n vertices and n - 1 + e edges. Here, we solve the spectral radius maximization problem on Cn, e when e 130 or n e + 2 + 13e.
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.