Optimal (r, 3)-locating-dominating codes in the infinite king grid

DOI10.1016/J.DAM.2013.04.027MaRDI QIDQ2444553zbMATH OpenOpenAlexFDO

Authors Mikko Pelto

Publication date 10 April 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2013.04.027

zbMATH Keywords

densitylocating-dominating codeking grid

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42) Bounds on codes (94B65) Fault detection; testing in circuits and networks (94C12)

Recommendations

• On \((r,\leq 2)\)-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
• Optimal identifying codes in the infinite 3-dimensional king grid
• New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid
• Locating-dominating codes: bounds and extremal cardinalities
• On the ensemble of optimal dominating and locating-dominating codes in a graph
• An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid
• Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
• Possible cardinalities for locating-dominating codes in graphs

Cites work

• scientific article; zbMATH DE number 4070954 (Why is no real title available?)
• scientific article; zbMATH DE number 2159641 (Why is no real title available?)
• Adaptive identification in Torii in the King lattice
• An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid
• Codes for identification in the king lattice
• Domination and location in acyclic graphs
• General bounds for identifying codes in some infinite regular graphs
• Identifying codes with small radius in some infinite regular graphs
• New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid
• On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
• On a new class of codes for identifying vertices in graphs
• On codes identifying vertices in the two-dimensional square lattice with diagonals
• On locating--dominating sets in infinite grids
• On locating-dominating codes for locating large numbers of vertices in the infinite king grid
• Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
• The minimum density of an identifying code in the king lattice.
• Watching systems in graphs: an extension of identifying codes
• Watching systems in the King grid

Cited in

(10)

• On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
• The metric dimension for resolving several objects
• Finding codes on infinite grids automatically
• On locating-dominating codes for locating large numbers of vertices in the infinite king grid
• scientific article; zbMATH DE number 6889668 (Why is no real title available?)
• New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid
• Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
• Spy game: FPT-algorithm, hardness and graph products
• Spy game: FPT-algorithm and results on graph products
• On locating-dominating codes in the infinite king grid.

This page was built for publication: Optimal \((r,\leq 3)\)-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 Q2444553)