EUVIMEDEUVIMED entdecken
Crossref

t-Secure Hop Dominating Sets in Graphs

Samuel John E. Parreno

Annals of Communications in Mathematics · 31.03.2026

DOI: 10.62072/acm.2026.09005 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Annals of Communications in Mathematics, online erschienen am 31.03.2026. Verfasst von Samuel John E. Parreno. Die Arbeit nennt 14 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Hop domination was introduced as a distance-two analogue of domination and has been studied extensively in recent years. A secure hop dominating set, recently introduced, models a single adversarial attack at an unoccupied vertex (a vertex not in the current guard set) that can be defended by relocating one guard at distance two while preserving hop domination. Motivated by finite-order (multi-step) protection in classical secure domination, we introduce t-secure hop dominating sets (t ∈ N0), in which an adversary may launch a sequence of at most t attacks, each at a currently unoccupied vertex, and the defender responds by sequentially relocating one guard at distance two after each attack while maintaining hop domination throughout. Our main contribution is an exact correspondence: t-secure hop domination in a graph G is equivalent to smart t-secure domination in the hop graph H(G). This yields structural properties (monotonicity and additivity over components) and exact values for several graph families, including complete multipartite graphs, stars, paths, and cycles. In particular, we obtain closed formulas for γsh,t(Pn) and γsh,t(Cn) for all t ∈ N0, with explicit small-n exceptions in the cycle case.

Zitieren

APA

Parreno, S. J. E. (2026). t-Secure Hop Dominating Sets in Graphs. Annals of Communications in Mathematics. https://doi.org/10.62072/acm.2026.09005

Vancouver

Parreno SJE. t-Secure Hop Dominating Sets in Graphs. Annals of Communications in Mathematics. 2026. doi:10.62072/acm.2026.09005

BibTeX
@article{Parreno2026,
  author = {Parreno, Samuel John E.},
  title = {t-Secure Hop Dominating Sets in Graphs},
  journal = {Annals of Communications in Mathematics},
  year = {2026},
  doi = {10.62072/acm.2026.09005}
}
Kostenlos starten →