On identification in the triangular grid



: Honkala I, Laihonen T

Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCE

: 2004

: Journal of Combinatorial Theory, Series B

: JOURNAL OF COMBINATORIAL THEORY SERIES B

: J COMB THEORY B

: 91

: 1

: 67

: 86

: 20

: 0095-8956

DOI: https://doi.org/10.1016/j.jctb.2003.10.002(external)


A subset C of vertices in a connected graph G = (V, E) is called (r, less than or equal to l)-identifying if for all subsets L subset of or equal to V of size at most l, the sets I(L), consisting of all the codewords which are within graphic distance r from at least one element in L, are different. It is proved that the minimum possible density of a (1, less than or equal to 2)-identifying code in the triangular grid is 9/16. (C) 2003 Elsevier Inc. All rights reserved.



Last updated on 2024-26-11 at 22:43