Identifying codes for infinite triangular grids with a finite number of rows
From MaRDI portal
Recommendations
Cites work
- A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
- Bounds for codes identifying vertices in the hexagonal grid
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- Identifying codes in some subgraphs of the square lattice
- Minimum-Density Identifying Codes in Square Grids
- New bounds for codes identifying vertices in graphs
- New bounds on the minimum density of an identifying code for the infinite hexagonal grid
- On a new class of codes for identifying vertices in graphs
Cited in
(11)- On identification in the triangular grid
- Locating-domination and identification
- Minimum density of identifying codes of king grids
- Minimum density of identifying codes of king grids
- 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)
