Locating-dominating codes in cycles
From MaRDI portal
Recommendations
- Locating-dominating codes in paths
- Possible cardinalities for locating-dominating codes in graphs
- Identifying codes and locating-dominating sets on paths and cycles
- Identifying and locating-dominating codes on chains and cycles
- Solving Two Conjectures regarding Codes for Location in Circulant Graphs
Cited in
(17)- Identifying and locating-dominating codes on chains and cycles
- Domination parameters in hypertrees and sibling trees
- Locating-dominating codes in paths
- Optimal bounds on codes for location in circulant graphs
- Locating-paired-dominating sets in square grids
- Locating and identifying codes in circulant networks
- Fault-tolerant detectors for distinguishing sets in cubic graphs
- Domination parameters in hypertrees
- Locating-domination and identification
- Solving Two Conjectures regarding Codes for Location in Circulant Graphs
- Open-independent, open-locating-dominating sets
- On Stronger Types of Locating-dominating Codes
- Possible cardinalities for locating-dominating codes in graphs
- Sharp bound on the truncated metric dimension of trees
- Identifying codes and locating-dominating sets on paths and cycles
- Fault tolerant detectors for distinguishing sets in graphs
- Identifying codes of cycles with odd orders
This page was built for publication: Locating-dominating codes in cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3090475)
