Locating-dominating codes in paths

DOI10.1016/J.DISC.2011.05.004MaRDI QIDQ2275442zbMATH OpenOpenAlexFDO

Authors Geoffrey Exoo, Ville Junnila, 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

dominationgraphlocating-dominating codeoptimal codepath

Mathematics Subject Classification ID

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

Recommendations

• Locating-dominating codes in cycles
• On \(r\)-locating-dominating sets in paths
• Possible cardinalities for locating-dominating codes in graphs
• Identifying codes and locating-dominating sets on paths and cycles
• Locating vertices using codes

Cites work

• An optimal locating-dominating set in the infinite triangular grid
• Approximability of identifying codes and locating-dominating codes
• Domination and location in acyclic graphs
• Extremal cardinalities for identifying and locating-dominating codes in graphs
• Fault-tolerant locating-dominating sets
• Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs
• scientific article; zbMATH DE number 3830444 (Why is no real title available?)
• scientific article; zbMATH DE number 3906528 (Why is no real title available?)
• scientific article; zbMATH DE number 4070954 (Why is no real title available?)
• scientific article; zbMATH DE number 2159641 (Why is no real title available?)
• scientific article; zbMATH DE number 861343 (Why is no real title available?)
• scientific article; zbMATH DE number 861404 (Why is no real title available?)
• Identifying and locating-dominating codes on chains and cycles
• Locating-dominating codes in cycles
• Locating-domination and identifying codes in trees
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• On \(r\)-locating-dominating sets in paths
• On locating--dominating sets in infinite grids

Cited in

(7)

• On \(r\)-locating-dominating sets in paths
• Identifying and locating-dominating codes on chains and cycles
• Locating-paired-dominating sets in square grids
• Locating-dominating codes in cycles
• Locating-domination and identification
• On Stronger Types of Locating-dominating Codes
• Locating-dominating codes: bounds and extremal cardinalities

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275442)