Improved Bounds forr-Identifying Codes of the Hex Grid

DOI10.1137/100791610zbMath1229.05232arXiv1004.1430OpenAlexW2005861518MaRDI QIDQ3094905

Brendon Stanton

Publication date: 27 October 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

hexagonal latticer-identifying codes

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) Fault detection; testing in circuits and networks (94C12)

Related Items (3)

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

This page was built for publication: Improved Bounds forr-Identifying Codes of the Hex Grid