On (r, 2)-locating-dominating codes in the infinite King grid
From MaRDI portal
(Redirected from Publication:414945)
On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
Recommendations
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
- On locating-dominating codes in the infinite king grid.
- On locating-dominating codes for locating large numbers of vertices in the infinite king grid
- New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid
- Locating-dominating codes: bounds and extremal cardinalities
- An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid
- On 2-edge robust \(r\)-identifying codes in the king grid
- Bound of \(r\)-identifying and \(r\)-locating-dominating codes in the Kronecker product graph of \(cy_n\) and \(\overline{k}_2\)
- Possible cardinalities for locating-dominating codes in graphs
- scientific article; zbMATH DE number 2159641
Cited in
(10)- scientific article; zbMATH DE number 6889668 (Why is no real title available?)
- On the ensemble of optimal identifying codes in a twin-free graph
- New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid
- On locating-dominating codes in the infinite king grid.
- Locating and identifying codes in dihedral graphs
- On locating-dominating codes for locating large numbers of vertices in the infinite king grid
- Identifying codes of corona product graphs
- On the number of optimal identifying codes in a twin-free graph
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
- On identifying codes in the King grid that are robust against edge deletions
This page was built for publication: On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414945)
