On the maximum spectral radius of connected graphs with a prescribed order and size
Filomat · 2025 · 39 (34) · 12281-12297
DOI: 10.2298/fil2534281d ↗Kurz gefasst
Fachartikel in der Zeitschrift Filomat, 2025. Verfasst von Ivan Damnjanovic. Die Arbeit nennt 20 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC0). Gefördert von: Ministry of Education, Science and Technological Development of the Republic of Serbia.
Abstract (Originalsprache)
The spectral radius of a graph is the largest modulus of an eigenvalue of its adjacency matrix. Let \mathrm{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 \mathrm{C_{n,e}} when e ≤ 130 or n ≥ e + 2 + 13√e.
Förderung
- Ministry of Education, Science and Technological Development of the Republic of Serbia
Zitieren
APA
Damnjanovic, I. (2025). On the maximum spectral radius of connected graphs with a prescribed order and size. Filomat, 39(34), 12281-12297. https://doi.org/10.2298/fil2534281d
Vancouver
Damnjanovic I. On the maximum spectral radius of connected graphs with a prescribed order and size. Filomat. 2025;39(34):12281-12297. doi:10.2298/fil2534281d
BibTeX
@article{Damnjanovic2025,
author = {Damnjanovic, Ivan},
title = {On the maximum spectral radius of connected graphs with a prescribed order and size},
journal = {Filomat},
year = {2025},
volume = {39},
number = {34},
pages = {12281--12297},
doi = {10.2298/fil2534281d}
}
EUVIMED