Domination number and (signless Laplacian) spectral radius of cactus graphs
The Electronic Journal of Linear Algebra · 30.04.2025 · 41 · 277-287
DOI: 10.13001/ela.2025.9307 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Linear Algebra, online erschienen am 30.04.2025. Verfasst von Yaqi Cui und 3 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref).
Abstract (Originalsprache)
A cactus graph is a connected graph whose block is either an edge or a cycle. A vertex set $S\subseteq V(G)$ is said to be a dominating set of a graph $G$ if every vertex in $V(G)\setminus S$ is adjacent to a vertex in $S$. There are several results on the (signless Laplacian) spectral radius and domination number in graph theory. In this paper, we determine the unique graph with the maximum adjacency spectral radius and signless Laplacian spectral radius among all cactus graphs with fixed domination number.
Zitieren
APA
Cui, Y., Chen, Y., Li, D., & Zhang, Y. (2025). Domination number and (signless Laplacian) spectral radius of cactus graphs. The Electronic Journal of Linear Algebra, 41, 277-287. https://doi.org/10.13001/ela.2025.9307
Vancouver
Cui Y, Chen Y, Li D, Zhang Y. Domination number and (signless Laplacian) spectral radius of cactus graphs. The Electronic Journal of Linear Algebra. 2025;41:277-287. doi:10.13001/ela.2025.9307
BibTeX
@article{Cui2025,
author = {Cui, Yaqi and Chen, Yuanyuan and Li, Dan and Zhang, Yue},
title = {Domination number and (signless Laplacian) spectral radius of cactus graphs},
journal = {The Electronic Journal of Linear Algebra},
year = {2025},
volume = {41},
pages = {277--287},
doi = {10.13001/ela.2025.9307}
}
EUVIMED