Lower bounds for identifying codes in some infinite grids

zbMath1272.05161arXiv1004.3281MaRDI QIDQ1960276

Brendon Stanton, Ryan R. Martin

Publication date: 13 October 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

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 (6)

Identifying codes in the complementary prism of cycles ⋮ New lower bound for 2-identifying code in the square grid ⋮ New bounds on the minimum density of an identifying code for the infinite hexagonal grid ⋮ Identifying codes of corona product graphs ⋮ Locating-Domination and Identification ⋮ Optimal open-locating-dominating sets in infinite triangular grids

This page was built for publication: Lower bounds for identifying codes in some infinite grids