Locating-paired-dominating sets in square grids

DOI10.1016/j.disc.2014.07.009zbMath1315.05102OpenAlexW2094654620MaRDI QIDQ2346332

L'udovít Niepel

Publication date: 1 June 2015

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

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

zbMATH Keywords

matchingdominationlocating-dominating codeinfinite square grid

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locating-total domination in graphs
• Bounds on the locating-total domination number of a tree
• Identifying codes and locating-dominating sets on paths and cycles
• On locating--dominating sets in infinite grids
• Locating and paired-dominating sets 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
• Locating-dominating codes in paths
• An optimal locating-dominating set in the infinite triangular grid
• Locating sensors in paths and cycles: the case of 2-identifying codes
• Locating and total dominating sets in trees
• Paired-domination in graphs