Fault-tolerant locating-dominating sets on the infinite king grid
Utilitas Mathematica · 22.07.2026 · 128 · 67-90
DOI: 10.61091/um128-04 ↗Kurz gefasst
Fachartikel in der Zeitschrift Utilitas Mathematica, online erschienen am 22.07.2026. Verfasst von Devin Jean und 1 weiteren Autor:innen.
Abstract (Originalsprache)
Let \(G\) be a graph of a network system with vertices, \(V(G)\), representing physical locations and edges, \(E(G)\), representing informational connectivity. A locating-dominating (LD) set \(S \subseteq V(G)\) is a subset of vertices representing detectors capable of sensing an “intruder” at precisely their location or at some unknown point in their open-neighborhood. An LD set must be capable of locating an intruder anywhere in the graph using this collection of detectors. We explore three types of fault-tolerant LD sets: redundant LD sets, which allow at most one detector to be removed or disabled, error-detecting LD sets, which allow at most one false negative, and error-correcting LD sets, which allow at most one error (false positive or false negative). In particular, we determine lower and upper bounds for the minimum density of these three fault-tolerant locating-dominating sets in the infinite king grid.
Zitieren
APA
Jean, D., & Seo, S. (2026). Fault-tolerant locating-dominating sets on the infinite king grid. Utilitas Mathematica, 128, 67-90. https://doi.org/10.61091/um128-04
Vancouver
Jean D, Seo S. Fault-tolerant locating-dominating sets on the infinite king grid. Utilitas Mathematica. 2026;128:67-90. doi:10.61091/um128-04
BibTeX
@article{Jean2026,
author = {Jean, Devin and Seo, Suk},
title = {Fault-tolerant locating-dominating sets on the infinite king grid},
journal = {Utilitas Mathematica},
year = {2026},
volume = {128},
pages = {67--90},
doi = {10.61091/um128-04}
}
EUVIMED