EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Maximizing the spectral radius of generalized cactus graphs

Zeyuan Wu, Hongzhang Chen, Jianxi Li

RAIRO - Operations Research · 2026-05 · 60 (3) · 1407-1418

DOI: 10.1051/ro/2026035 ↗

Kurz gefasst

Fachartikel in der Zeitschrift RAIRO - Operations Research, online erschienen am 20.05.2026. Verfasst von Zeyuan Wu und 2 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

For an integer k ≥ 0, a connected graph G is called a k -cactus graph if each edge e ∈ E ( G ) is contained in at most k cycles of G . Inspired by the Brualdi-Solheid problem, in this paper, we address the problem of determining the maximum spectral radius of k -cactus graphs. Lovász and Pelikán [ Period. Math. Hungar. 3 (1973) 175–182], Borovićanin and Petrović [ Publ. Inst. Math. (Beograd) (N.S.) 7 9 (2006) 13–18] resolved the cases of k = 0 and k = 1, respectively. We solve this problem for the cases of k = 2 and k = 3 that is the graphs with the maximum spectral radius among all 2-cactus graphs and 3-cactus graphs are determined, respectively.

Zitieren

APA

Wu, Z., Chen, H., & Li, J. (2026). Maximizing the spectral radius of generalized cactus graphs. RAIRO - Operations Research, 60(3), 1407-1418. https://doi.org/10.1051/ro/2026035

Vancouver

Wu Z, Chen H, Li J. Maximizing the spectral radius of generalized cactus graphs. RAIRO - Operations Research. 2026;60(3):1407-1418. doi:10.1051/ro/2026035

BibTeX
@article{Wu2026,
  author = {Wu, Zeyuan and Chen, Hongzhang and Li, Jianxi},
  title = {Maximizing the spectral radius of generalized cactus graphs},
  journal = {RAIRO - Operations Research},
  year = {2026},
  volume = {60},
  number = {3},
  pages = {1407--1418},
  doi = {10.1051/ro/2026035}
}
Kostenlos starten →