New lower bound for 2-identifying code in the square grid

DOI10.1016/j.dam.2013.02.032zbMath1286.05137arXiv1202.0671OpenAlexW2020740656MaRDI QIDQ2446847

Ville Junnila

Publication date: 22 April 2014

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

Full work available at URL: https://arxiv.org/abs/1202.0671

zbMATH Keywords

dominationidentifying codesquare gridinfinite grid

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Bounds on codes (94B65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

New lower bound for 2-identifying code in the square grid ⋮ Locating-Domination and Identification ⋮ IDonSquareGridR2 ⋮ Minimum-Density Identifying Codes in Square Grids ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids

Uses Software

• Mathematica

Cites Work

• Optimal lower bound for 2-identifying codes in the hexagonal grid
• Fault-tolerant locating-dominating sets
• On the density of identifying codes in the square lattice
• Lower bounds for identifying codes in some infinite grids
• New lower bound for 2-identifying code in the square grid
• On a new class of codes for identifying vertices in graphs
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid
• General bounds for identifying codes in some infinite regular graphs
• Identifying codes with small radius in some infinite regular graphs

This page was built for publication: New lower bound for 2-identifying code in the square grid