An optimal locating-dominating set in the infinite triangular grid

DOI10.1016/j.disc.2006.04.028zbMath1118.05072MaRDI QIDQ2433724

Iiro S. Honkala

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

zbMATH Keywords

graph; density; triangular grid; locating-dominating set

Mathematics Subject Classification ID

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

The binary locating-dominating number of some convex polytopes, Open-independent, open-locating-dominating sets, On locating--dominating sets in infinite grids, Fault tolerant detectors for distinguishing sets in graphs, Locating-dominating codes: bounds and extremal cardinalities, On \(r\)-locating-dominating sets in paths, Perfect domination ratios of Archimedean lattices, Locating-dominating codes in paths, Optimal bounds on codes for location in circulant graphs, Locating-paired-dominating sets in square grids, Optimal open-locating-dominating sets in infinite triangular grids, On identifying codes that are robust against edge changes, Locating and identifying codes in circulant networks, Liar's domination, Locating-Domination and Identification

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