Identifying codes for infinite triangular grids with a finite number of rows
From MaRDI portal
Publication:526246
DOI10.1016/J.DISC.2017.02.015zbMATH Open1361.05128OpenAlexW2508237622MaRDI QIDQ526246FDOQ526246
Authors: Rennan Dantas, Frédéric Havet, Rudini M. 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
Recommendations
Cites Work
- On a new class of codes for identifying vertices in graphs
- Identifying codes in some subgraphs of the square lattice
- 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
- New bounds for codes identifying vertices in graphs
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
Cited In (11)
- Locating-domination and identification
- Minimum density of identifying codes of king grids
- Minimum density of identifying codes of king grids
- On identification in the triangular grid
- On Identifying Codes in the Triangular and Square Grids
- Operads of finite posets
- An optimal strongly identifying code in the infinite triangular grid
- On the minimum size of an identifying code over all orientations of a graph
- Lower bounds for identifying codes in some infinite grids
- Completely regular codes in the infinite hexagonal grid
- Density of identifying codes of hexagonal grids with finite number of rows
This page was built for publication: Identifying codes for infinite triangular grids with a finite number of rows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526246)
