Minimum density of identifying codes of king grids

DOI10.1016/j.disc.2018.06.035zbMath1393.05253OpenAlexW2883622084WikidataQ129559044 ScholiaQ129559044MaRDI QIDQ5915700

Rudini Menezes Sampaio, Frédéric Havet, Rennan Dantas

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

identifying codesdischarging methodking grids

Mathematics Subject Classification ID

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

Related Items (4)

Optimal identifying codes of two families of Cayley graphs ⋮ Spy game: FPT-algorithm, hardness and graph products ⋮ Spy game: FPT-algorithm and results on graph products ⋮ Locating-Domination and Identification

Cites Work

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

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