This is a SageMath implementation of an algorithm that verifies the claim that no connected threshold graph can attain the maximum spectral radius on the set of connected graphs with a prescribed order and size apart from the one or two graphs obtained by a well-known construction.
If you are using the software in your research, please cite this paper:
- I. Damnjanović, On the maximum spectral radius of connected graphs with a prescribed order and size, Filomat 39 (2025), 12281–12297, https://doi.org/10.2298/FIL2534281D.