Grundy Locating-Hop Domination Sequences in Graphs
Annals of Communications in Mathematics · 17.06.2026
DOI: 10.62072/acm.2026.09028 ↗Kurz gefasst
Fachartikel in der Zeitschrift Annals of Communications in Mathematics, online erschienen am 17.06.2026. Verfasst von Samuel John E. Parreño.
Abstract (Originalsprache)
Locating-hop domination refines hop domination by requiring vertices outside a hop dominating set to have nonempty and pairwise distinct distance-two signatures. Dominating sequences, on the other hand, measure how long domination can be built through legal vertex choices. This paper introduces Grundy locating-hop domination sequences, in which a vertex choice is legal when it either footprints a previously undominated vertex through a closed hop neighborhood or strictly reduces an ambiguity potential that counts indistinguishable outside vertex pairs. The associated invariant is denoted by 𝛾 𝓁ℎ gr (𝐺). General bounds are established, including 𝛾𝓁ℎ(𝐺) ≤ 𝛾 𝓁ℎ gr (𝐺) ≤ 𝑛(𝐺). The parameter is additive over disjoint unions, and a hop-graph reduction identifies 𝛾 𝓁ℎ gr (𝐺) with the corresponding locating-dominating sequence parameter on the hop graph 𝐺(2). Exact values are obtained for complete graphs and stars. In particular, 𝛾 𝓁ℎ gr (𝐾𝑛) = 𝑛 and 𝛾 𝓁ℎ gr (𝐾1,𝑛) = 𝑛 for 𝑛 ≥ 2. Stars also give an infinite separation family: for 𝑛 ≥ 3, 𝛾 ℎ gr(𝐾1,𝑛) = 2 while 𝛾 𝓁ℎ gr (𝐾1,𝑛) = 𝑛.
Zitieren
APA
Parreño, S. J. E. (2026). Grundy Locating-Hop Domination Sequences in Graphs. Annals of Communications in Mathematics. https://doi.org/10.62072/acm.2026.09028
Vancouver
Parreño SJE. Grundy Locating-Hop Domination Sequences in Graphs. Annals of Communications in Mathematics. 2026. doi:10.62072/acm.2026.09028
BibTeX
@article{Parreo2026,
author = {Parreño, Samuel John E.},
title = {Grundy Locating-Hop Domination Sequences in Graphs},
journal = {Annals of Communications in Mathematics},
year = {2026},
doi = {10.62072/acm.2026.09028}
}
EUVIMED