An optimal locating-dominating set in the infinite triangular grid
From MaRDI portal
Publication:2433724
DOI10.1016/j.disc.2006.04.028zbMath1118.05072OpenAlexW2023772760MaRDI QIDQ2433724
Publication date: 30 October 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.04.028
Related Items (15)
On locating--dominating sets in infinite grids ⋮ On identifying codes that are robust against edge changes ⋮ Fault tolerant detectors for distinguishing sets in graphs ⋮ Locating-dominating codes: bounds and extremal cardinalities ⋮ The binary locating-dominating number of some convex polytopes ⋮ Locating and identifying codes in circulant networks ⋮ Locating-dominating codes in paths ⋮ Liar's domination ⋮ Locating-Domination and Identification ⋮ On \(r\)-locating-dominating sets in paths ⋮ Optimal bounds on codes for location in circulant graphs ⋮ Perfect domination ratios of Archimedean lattices ⋮ Open-independent, open-locating-dominating sets ⋮ Locating-paired-dominating sets in square grids ⋮ Optimal open-locating-dominating sets in infinite triangular grids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- Fault-tolerant locating-dominating sets
- Identifying and locating-dominating codes on chains and cycles
- An optimal edge-robust identifying code in the triangular lattice
- On robust and dynamic identifying codes
- On a new class of codes for identifying vertices in graphs
- On Identifying Codes in the Triangular and Square Grids
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- General bounds for identifying codes in some infinite regular graphs
- Identifying codes with small radius in some infinite regular graphs
This page was built for publication: An optimal locating-dominating set in the infinite triangular grid
