A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
From MaRDI portal
Publication:2380272
zbMath1186.05070arXiv1006.3779MaRDI QIDQ2380272
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.3779
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (12)
Watching systems in the King grid ⋮ An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid ⋮ Locating and identifying codes in circulant networks ⋮ New bounds on the minimum density of an identifying code for the infinite hexagonal grid ⋮ Identifying codes of corona product graphs ⋮ Operads of finite posets ⋮ On the minimum size of an identifying code over all orientations of a graph ⋮ Identifying codes for infinite triangular grids with a finite number of rows ⋮ Minimum density of identifying codes of king grids ⋮ Minimum density of identifying codes of king grids ⋮ Open locating-dominating sets in circulant graphs ⋮ Optimal open-locating-dominating sets in infinite triangular grids
This page was built for publication: A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
