Locating-dominating codes in paths

DOI10.1016/j.disc.2011.05.004zbMath1225.05193OpenAlexW2032559512MaRDI QIDQ2275442

Ville Junnila, Geoffrey Exoo, Tero Laihonen

Publication date: 9 August 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.05.004

zbMATH Keywords

graphpathdominationoptimal codelocating-dominating code

Mathematics Subject Classification ID

Paths and cycles (05C38) Other types of codes (94B60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Locating-dominating codes: bounds and extremal cardinalities ⋮ Locating-Domination and Identification ⋮ Locating-paired-dominating sets in square grids

Cites Work

• On locating--dominating sets in infinite grids
• Extremal cardinalities for identifying and locating-dominating codes in graphs
• On \(r\)-locating-dominating sets in paths
• 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
• Approximability of identifying codes and locating-dominating codes
• An optimal locating-dominating set in the infinite triangular grid
• Domination and location in acyclic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Locating-dominating codes in paths