Optimal identifying codes in the infinite 3-dimensional king grid

DOI10.1016/J.EJC.2013.10.002MaRDI QIDQ2441660zbMATH OpenOpenAlexFDO

Authors Mikko Pelto

Publication date 25 March 2014

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2013.10.002

zbMATH Keywords

minimum identifying codeminimum packing problem of cubes in the 3-dimensional lattice

Mathematics Subject Classification ID

Applications of graph theory (05C90) Distance in graphs (05C12) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial codes (94B25) Bounds on codes (94B65)

Recommendations

• The minimum density of an identifying code in the king lattice.
• Minimum density of identifying codes of king grids
• Minimum density of identifying codes of king grids
• Codes for identification in the king lattice
• New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid

Cites work

• Codes for identification in the king lattice
• Domination and location in acyclic graphs
• Fault-tolerant locating-dominating sets
• Identifying and locating-dominating codes on chains and cycles
• Identifying codes with small radius in some infinite regular graphs
• New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid
• On a new class of codes for identifying vertices in graphs
• On a new class of identifying codes in graphs
• On codes identifying vertices in the two-dimensional square lattice with diagonals
• The minimum density of an identifying code in the king lattice.
• Vertex identifying codes for the \(n\)-dimensional lattice

Cited in

(7)

• The minimum density of an identifying code in the king lattice.
• Minimum density of identifying codes of king grids
• On identifying codes in the King grid that are robust against edge deletions
• An optimal strongly identifying code in the infinite triangular grid
• 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
• Codes for identification in the king lattice

This page was built for publication: Optimal identifying codes in the infinite 3-dimensional king grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2441660)