Identifying codes for infinite triangular grids with a finite number of rows

Description

Let G be a graph G. The neighborhood of a vertex v in G, denoted by N (v), is the set of vertices adjacent to v i G. It closed neighborhood is the set N [v] = N (v) ∪ {v}. A set C ⊆ V (G) is an identifying code in G if (i) for all v ∈ V (G), N [v] ∩ C = ∅, and (ii) for all u, v ∈ V (G), N [u] ∩ C = N [v] ∩ C.In this paper, we give some bounds on the minimum density of an identifying code in triangular grids of bounded height.

Abstract

International audience

Additional details