Possible cardinalities for locating-dominating codes in graphs
From MaRDI portal
(Redirected from Publication:5487899)
Recommendations
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Locating-dominating codes in cycles
- Locating vertices using codes
- On locating-dominating codes for locating large numbers of vertices in the infinite king grid
- The compared costs of domination location-domination and identification
Cited in
(16)- On \(r\)-locating-dominating sets in paths
- Locating-dominating codes in paths
- The compared costs of domination location-domination and identification
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- On the ensemble of optimal dominating and locating-dominating codes in a graph
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
- Locating-dominating codes in cycles
- On locating-dominating codes for locating large numbers of vertices in the infinite king grid
- Locating-domination and identification
- Locating vertices using codes
- On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
- Solving Two Conjectures regarding Codes for Location in Circulant Graphs
- On locating numbers of graphs
- Independent location-domination number of graphs
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Locating-dominating codes: bounds and extremal cardinalities
This page was built for publication: Possible cardinalities for locating-dominating codes in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487899)
