Locating-paired-dominating sets in square grids
From MaRDI portal
Publication:2346332
Recommendations
Cites work
- An optimal locating-dominating set in the infinite triangular grid
- Bounds on the locating-total domination number of a tree
- Fault-tolerant locating-dominating sets
- scientific article; zbMATH DE number 3906528 (Why is no real title available?)
- scientific article; zbMATH DE number 4053685 (Why is no real title available?)
- scientific article; zbMATH DE number 1185309 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- Identifying and locating-dominating codes on chains and cycles
- Identifying codes and locating-dominating sets on paths and cycles
- Locating and paired-dominating sets in graphs
- Locating and total dominating sets in trees
- Locating sensors in paths and cycles: the case of 2-identifying codes
- Locating-dominating codes in cycles
- Locating-dominating codes in paths
- Locating-total domination in graphs
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- On locating--dominating sets in infinite grids
- Paired-domination in graphs
Cited in
(2)
This page was built for publication: Locating-paired-dominating sets in square grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2346332)