A1 Refereed original research article in a scientific journal
On identification in the triangular grid
Authors: Honkala I, Laihonen T
Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCE
Publication year: 2004
Journal: Journal of Combinatorial Theory, Series B
Journal name in source: JOURNAL OF COMBINATORIAL THEORY SERIES B
Journal acronym: J COMB THEORY B
Volume: 91
Issue: 1
First page : 67
Last page: 86
Number of pages: 20
ISSN: 0095-8956
DOI: https://doi.org/10.1016/j.jctb.2003.10.002
Abstract
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.
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.
UTU Research Portal