On locating--dominating sets in infinite grids
From MaRDI portal
Publication:819007
DOI10.1016/J.EJC.2004.09.002zbMATH Open1082.05069OpenAlexW2063757303MaRDI QIDQ819007FDOQ819007
Authors: Tero Laihonen, Iiro Honkala 
Publication date: 22 March 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2004.09.002
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)
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
- Identifying and locating-dominating codes on chains and cycles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Domination and location in acyclic graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- Title not available (Why is that?)
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Fault-tolerant locating-dominating sets
- On robust and dynamic identifying codes
- Title not available (Why is that?)
- An optimal locating-dominating set in the infinite triangular grid
Cited In (31)
- Domination parameters in hypertrees
- An explicit construction of optimal dominating and [1, 2]–dominating sets in grid
- Liar's domination
- Locating-paired-dominating sets in square grids
- Locating and identifying codes in circulant graphs
- An optimal locating-dominating set in the infinite triangular grid
- Optimal bounds on codes for location in circulant graphs
- Fault-tolerant resolvability of some graphs of convex polytopes
- Locating-domination and identification
- Extremal cubic graphs for fault-tolerant locating domination
- Locating domination in bipartite graphs and their complements
- Optimal local identifying and local locating-dominating codes
- Binary locating-dominating sets in rotationally-symmetric convex polytopes
- The locating number of hexagonal Möbius ladder network
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices
- Fault tolerant detectors for distinguishing sets in graphs
- ON MULTIPLE INTRUDER LOCATING DOMINATION IN INFINITE GRIDS
- Open-independent, open-locating-dominating sets
- Title not available (Why is that?)
- On the binary locating-domination number of regular and strongly-regular graphs
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
- Domination parameters in hypertrees and sibling trees
- Bounds of fault-tolerant locating-dominating sets
- Locating and identifying codes in circulant networks
- Fault-tolerant locating-dominating sets
- On \(r\)-locating-dominating sets in paths
- On identifying codes that are robust against edge changes
- Optimal error-detection system for identifying codes
- The binary locating-dominating number of some convex polytopes
- Asymptotic growth rate of square grids dominating sets: a symbolic dynamics approach
- Locating-dominating codes in paths
This page was built for publication: On locating--dominating sets in infinite grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q819007)
