On r-locating-dominating sets in paths
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4070954 (Why is no real title available?)
- scientific article; zbMATH DE number 1735664 (Why is no real title available?)
- scientific article; zbMATH DE number 861404 (Why is no real title available?)
- An optimal locating-dominating set in the infinite triangular grid
- Bounds on identifying codes
- Fault-tolerant locating-dominating sets
- Identifying and locating-dominating codes on chains and cycles
- Identifying codes of cycles
- Identifying codes with small radius in some infinite regular graphs
- Locating sensors in paths and cycles: the case of 2-identifying codes
- On a new class of codes for identifying vertices in graphs
- On locating--dominating sets in infinite grids
- Structural properties of twin-free graphs
Cited in
(5)- Identifying codes and locating-dominating sets on paths and cycles
- Optimal identifying codes in cycles and paths
- Locating-domination and identification
- 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
This page was built for publication: On \(r\)-locating-dominating sets in paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024298)