2000 character limit reached
On the maximum spectral radius of connected graphs with a prescribed order and size
Published 22 Mar 2025 in math.CO | (2503.17883v2)
Abstract: The spectral radius of a graph is the largest modulus of an eigenvalue of its adjacency matrix. Let $\mathcal{C}{n, 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 $\mathcal{C}{n, e}$ when $e \le 130$ or $n \ge e + 2 + 13\sqrt{e}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.