Density of identifying codes of hexagonal grids with finite number of rows

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Bounds on codes (94B65)

Recommendations

New bounds on the minimum density of an identifying code for the infinite hexagonal grid
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
Lower bounds for identifying codes in some infinite grids
Identifying codes for infinite triangular grids with a finite number of rows

Cites work

A characterization of the minimum cycle mean in a digraph
A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
An introduction to the discharging method via graph coloring
Bounds for codes identifying vertices in the hexagonal grid
Codes for identification in the king lattice
Exact Minimum Density of Codes Identifying Vertices in the Square Grid
Fault-tolerant locating-dominating sets
Finding minimum cost to time ratio cycles with small integral transit times
General bounds for identifying codes in some infinite regular graphs
Identifying codes for infinite triangular grids with a finite number of rows
Identifying codes in some subgraphs of the square lattice
Identifying codes with small radius in some infinite regular graphs
Lower bounds for identifying codes in some infinite grids
Minimum density of identifying codes of king grids
Minimum-Density Identifying Codes in Square Grids
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
On identification in the triangular grid
On identifying codes
On identifying codes in the hexagonal mesh
On Identifying Codes in the Triangular and Square Grids
On the density of identifying codes in the square lattice
On the identification of sets of points in the square lattice
Optimal lower bound for 2-identifying codes in the hexagonal grid
Periodicity of identifying codes in strips
The minimum density of an identifying code in the king lattice.

Cited in

(9)

Fault-tolerant locating-dominating sets on the infinite tumbling block graph
Optimal error-detection system for identifying codes
Fault-tolerant locating-dominating sets with error-correction
Fault-tolerant detection systems on the infinite King grid
Error-correcting open-locating-dominating sets
On the density of (1, )-locating-dominating codes in the infinite square grid
Fault-tolerant locating-dominating sets on the infinite king grid
New optimal results on codes for location in graphs
On (1, l)-locating-dominating codes in infinite triangular grid

This page was built for publication: Density of identifying codes of hexagonal grids with finite number of rows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550909)