The number of completely different optimal identifying codes in the infinite square grid

DOI10.1016/J.DAM.2017.07.012MaRDI QIDQ2410258zbMATH OpenOpenAlexFDO

Authors Mikko Pelto

Publication date 17 October 2017

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

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

zbMATH Keywords

latticedensitydiscrete geometrydifferenceidentifying code

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Exact Minimum Density of Codes Identifying Vertices in the Square Grid
• Minimum-Density Identifying Codes in Square Grids
• On Identifying Codes in the Triangular and Square Grids
• Lower bounds for identifying codes in some infinite grids
• Identifying codes in some subgraphs of the square lattice

Cites work

• Domination and location in acyclic graphs
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid
• On a new class of codes for identifying vertices in graphs

Cited in

(7)

• Minimum-Density Identifying Codes in Square Grids
• New lower bound for 2-identifying code in the square grid
• An optimal strongly identifying code in the infinite triangular grid
• Optimal identifying codes of two families of Cayley graphs
• Lower bounds for identifying codes in some infinite grids
• Completely regular codes in the infinite hexagonal grid
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid

This page was built for publication: The number of completely different optimal identifying codes in the infinite square grid

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