Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Discrete Mathematics

arXiv:2212.08193 (cs)
[Submitted on 15 Dec 2022]

Title:Fault-Tolerant Locating-Dominating sets with Error-correction

Authors:Devin Jean, Suk Seo
View PDF
Abstract:A locating-dominating set is a subset of vertices representing "detectors" in a graph G; each detector monitors its closed neighborhood and can distinguish its own location from its neighbors, and given all sensor input, the system can locate an "intruder" anywhere in the graph. We explore a fault-tolerant variant of locating-dominating sets, error-correcting locating-dominating (ERR:LD) sets, which can tolerate an incorrect signal from a single detector. In particular, we characterize error-correcting locating-dominating sets, and derive its existence criteria. We also prove that the problem of determining the minimum cardinality of ERR:LD set in arbitrary graphs is NP-complete. Additionally, we establish lower and upper bounds for the minimum density of ERR:LD sets in infinite grids and cubic graphs, and prove the lower bound for cubic graphs is sharp.
Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)
MSC classes: 05C69
Cite as: arXiv:2212.08193 [cs.DM]
  (or arXiv:2212.08193v1 [cs.DM] for this version)
  https://doi.org/10.48550/arXiv.2212.08193

Submission history

From: Devin Jean [view email]
[v1] Thu, 15 Dec 2022 23:28:31 UTC (951 KB)
Full-text links:

Access Paper:

license icon view license
Current browse context:
cs.DM
< prev   |   next >
new | recent | 2022-12
Change to browse by:
cs
math
math.CO

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)