On redundant locating-dominating sets
From MaRDI portal
Publication:2686136
DOI10.1016/J.DAM.2023.01.023OpenAlexW4320168461MaRDI QIDQ2686136FDOQ2686136
Authors: Devin C. Jean, Suk J. Seo 
Publication date: 24 February 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.04500
Recommendations
densitycharacterizationNP-completelocating-dominating setsfault-tolerantextremal treesredundant locating-dominating sets
Cites Work
- Title not available (Why is that?)
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- On a new class of codes for identifying vertices in graphs
- Fault-tolerant metric dimension of graphs
- Determining sets, resolving sets, and the exchange property
- Nordhaus-Gaddum bounds for locating domination
- Title not available (Why is that?)
- The metric dimension of the lexicographic product of graphs
- Title not available (Why is that?)
- Domination and location in acyclic graphs
- Locating-dominating sets in twin-free graphs
- Title not available (Why is that?)
- Watching systems in graphs: an extension of identifying codes
- Fault-tolerant locating-dominating sets
- Title not available (Why is that?)
- Fault tolerant detectors for distinguishing sets in graphs
- Extremal cubic graphs for fault-tolerant locating domination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Progress on fault-tolerant locating-dominating sets
Cited In (6)
This page was built for publication: On redundant locating-dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2686136)
