Identifying codes for infinite triangular grids with a finite number of rows
From MaRDI portal
Publication:526246
DOI10.1016/j.disc.2017.02.015zbMath1361.05128OpenAlexW2508237622MaRDI QIDQ526246
Frédéric Havet, Rennan Dantas, Rudini Menezes Sampaio
Publication date: 10 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01527023/file/tri-rudini.pdf
Related Items (5)
Operads of finite posets ⋮ On the minimum size of an identifying code over all orientations of a graph ⋮ Minimum density of identifying codes of king grids ⋮ Minimum density of identifying codes of king grids ⋮ Locating-Domination and Identification
Cites Work
- Identifying codes in some subgraphs of the square lattice
- New bounds for codes identifying vertices in graphs
- A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
- New bounds on the minimum density of an identifying code for the infinite hexagonal grid
- Bounds for Codes Identifying Vertices in the Hexagonal Grid
- Minimum-Density Identifying Codes in Square Grids
- On a new class of codes for identifying vertices in graphs
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
This page was built for publication: Identifying codes for infinite triangular grids with a finite number of rows
