Maximization problem addresses spectral radius in connected graphs with specific edges, indicating significant limits.
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 + 13√e.
No takes yet. Share an insight, caveat, or question.
Ivan Damnjanovic (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: