An optimal strongly identifying code in the infinite triangular grid
From MaRDI portal
Publication:986692
zbMath1193.05125MaRDI QIDQ986692
Publication date: 12 August 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/231681
Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
Optimal identifying codes of two families of Cayley graphs ⋮ Fault tolerant detectors for distinguishing sets in graphs ⋮ Identifying codes of corona product graphs ⋮ Locating-Domination and Identification ⋮ Open-independent, open-locating-dominating sets ⋮ Optimal open-locating-dominating sets in infinite triangular grids
This page was built for publication: An optimal strongly identifying code in the infinite triangular grid
