No abstract

No abstract

No abstract

No abstract

International audienceLet G T be the infinite triangular grid. For any positive integer k, we denote by T k the subgraph of G T induced by the vertex set {(x, y) ∈ Z × [k]}. A set C ⊂ V (G) is an identifying code in a graph G if for all v ∈ V (G), N [v] ∩ C = ∅, and for all u, v ∈ V (G), N [u]∩C = N [v]∩C, where N [x] denotes the closed neighborhood of x in G. The minimum density of an identifying code in G is denoted by d * (G). In this paper, we prove that d * (T 1) = d * (T 2) = 1/2, d * (T 3) = d * (T 4) = 1/3, d * (T 5) = 3/10, d * (T 6) = 1/3 and d * (T k) = 1/4 + 1/(4k) for every k ≥ 7 odd. Moreover, we prove that 1/4 + 1/(4k) ≤ d * (T k) ≤ 1/4 + 1/(2k) for every k ≥ 8 even