On \(r\)-locating-dominating sets in paths

DOI10.1016/j.ejc.2008.04.011zbMath1186.05092MaRDI QIDQ1024298

Iiro S. Honkala

Publication date: 17 June 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.04.011

zbMATH Keywords

2-locating dominating set

Mathematics Subject Classification ID

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

Related Items

Identifying codes and locating-dominating sets on paths and cycles, Optimal identifying codes in cycles and paths, The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations, Locating-dominating codes in paths, Locating-Domination and Identification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On locating--dominating sets in infinite grids
• Structural properties of twin-free graphs
• Fault-tolerant locating-dominating sets
• Identifying and locating-dominating codes on chains and cycles
• An optimal locating-dominating set in the infinite triangular grid
• Locating sensors in paths and cycles: the case of 2-identifying codes
• Identifying codes of cycles
• On a new class of codes for identifying vertices in graphs
• Bounds on identifying codes
• Identifying codes with small radius in some infinite regular graphs