Minimum density of identifying codes of king grids

DOI10.1016/J.DISC.2018.06.035MaRDI QIDQ5915700zbMATH OpenOpenAlexWikidataFDO

Authors Rennan Dantas, Frédéric Havet, Rudini M. Sampaio

Publication date 15 August 2018

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01861913/file/idcodes-king.pdf

zbMATH Keywords

discharging methodidentifying codesking grids

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Graph operations (line graphs, products, etc.) (05C76) Graph theory (05C99) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Minimum density of identifying codes of king grids
• The minimum density of an identifying code in the king lattice.
• Minimum-Density Identifying Codes in Square Grids
• An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid
• Optimal identifying codes in the infinite 3-dimensional king grid
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid
• New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid
• Codes for identification in the king lattice
• On 2-edge robust \(r\)-identifying codes in the king grid
• New bounds on the minimum density of an identifying code for the infinite hexagonal grid

Cites work

• A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
• Bounds for codes identifying vertices in the hexagonal grid
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid
• Identifying codes for infinite triangular grids with a finite number of rows
• Identifying codes in some subgraphs of the square lattice
• Identifying codes with small radius in some infinite regular graphs
• Minimum-Density Identifying Codes in Square Grids
• New bounds for codes identifying vertices in graphs
• New bounds on the minimum density of an identifying code for the infinite hexagonal grid
• On a new class of codes for identifying vertices in graphs
• Periodicity of identifying codes in strips
• Watching systems in the King grid

Cited in

(18)

• On identifying codes in the King grid that are robust against edge deletions
• The minimum density of an identifying code in the king lattice.
• Codes for identification in the king lattice
• Periodicity of identifying codes in strips
• Optimal identifying codes of two families of Cayley graphs
• Watching systems in the King grid
• New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid
• An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid
• Optimal identifying codes in the infinite 3-dimensional king grid
• Spy game: FPT-algorithm, hardness and graph products
• Spy game: FPT-algorithm and results on graph products
• Minimum-Density Identifying Codes in Square Grids
• Locating-domination and identification
• Minimum density of identifying codes of king grids
• Density of identifying codes of hexagonal grids with finite number of rows
• Fault-tolerant detection systems on the infinite King grid
• Encoding paths with binary arrays in a king's graph for error-free data transmission
• Fault-tolerant locating-dominating sets on the infinite king grid

This page was built for publication: Minimum density of identifying codes of king grids

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