On locating--dominating sets in infinite grids

DOI10.1016/j.ejc.2004.09.002zbMath1082.05069OpenAlexW2063757303MaRDI QIDQ819007

Tero Laihonen, Iiro S. 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

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (22)

On identifying codes that are robust against edge changes ⋮ Extremal cubic graphs for fault-tolerant locating domination ⋮ ON MULTIPLE INTRUDER LOCATING DOMINATION IN INFINITE GRIDS ⋮ Domination parameters in hypertrees and sibling trees ⋮ Fault tolerant detectors for distinguishing sets in graphs ⋮ Locating domination in bipartite graphs and their complements ⋮ Fault-tolerant resolvability of some graphs of convex polytopes ⋮ On the binary locating-domination number of regular and strongly-regular graphs ⋮ The binary locating-dominating number of some convex polytopes ⋮ Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid ⋮ Locating and identifying codes in circulant networks ⋮ Locating and identifying codes in circulant graphs ⋮ Locating-dominating codes in paths ⋮ Liar's domination ⋮ Domination Parameters in Hypertrees ⋮ Locating-Domination and Identification ⋮ On \(r\)-locating-dominating sets in paths ⋮ Optimal bounds on codes for location in circulant graphs ⋮ Metric-locating-dominating sets of graphs for constructing related subsets of vertices ⋮ Open-independent, open-locating-dominating sets ⋮ Binary locating-dominating sets in rotationally-symmetric convex polytopes ⋮ Locating-paired-dominating sets in square grids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal cardinalities for identifying and locating-dominating codes in graphs
• 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 locating-dominating set in the infinite triangular grid
• On robust and dynamic identifying codes
• Domination and location in acyclic graphs
• On a new class of codes for identifying vertices in graphs
• Identifying and locating-dominating codes: NP-completeness results for directed graphs

This page was built for publication: On locating--dominating sets in infinite grids