Papers › On the maximum spectral radius of connected graphs with a prescribed order and size
On the maximum spectral radius of connected graphs with a prescribed order and size
Ivan Damnjanović
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The spectral radius of a graph is the largest modulus of an eigenvalue of its adjacency matrix. Let 𝒞_(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 𝒞_(n, e) when e ≤130 or n ≥e + 2 + 13√(e).
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections