Crossref
Maximizing the spectral radius of minimally connected graphs with size m and no 2-clique cutsets
Discrete Applied Mathematics · 2026-07 · 388 · 162-173
DOI: 10.1016/j.dam.2026.03.032 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-07. Verfasst von Shu-Guang Guo und 1 weiteren Autor:innen. Die Arbeit nennt 30 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Guo, S., & Zhang, R. (2026). Maximizing the spectral radius of minimally connected graphs with size m and no 2-clique cutsets. Discrete Applied Mathematics, 388, 162-173. https://doi.org/10.1016/j.dam.2026.03.032
Vancouver
Guo S, Zhang R. Maximizing the spectral radius of minimally connected graphs with size m and no 2-clique cutsets. Discrete Applied Mathematics. 2026;388:162-173. doi:10.1016/j.dam.2026.03.032
BibTeX
@article{Guo2026,
author = {Guo, Shu-Guang and Zhang, Rong},
title = {Maximizing the spectral radius of minimally connected graphs with size m and no 2-clique cutsets},
journal = {Discrete Applied Mathematics},
year = {2026},
volume = {388},
pages = {162--173},
doi = {10.1016/j.dam.2026.03.032}
}
EUVIMED