A1 Refereed original research article in a scientific journal
On the density of identifying codes in the square lattice
Authors: Honkala I, Lobstein A
Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCE
Publication year: 2002
Journal: Journal of Combinatorial Theory, Series B
Journal name in source: JOURNAL OF COMBINATORIAL THEORY SERIES B
Journal acronym: J COMB THEORY B
Volume: 85
Issue: 2
First page : 297
Last page: 306
Number of pages: 10
ISSN: 0095-8956
DOI: https://doi.org/10.1006/jctb.2001.2106
Abstract
Let G = (V, E) be an undirected graph and C a subset of vertices. If the sets B-r(nu) boolean AND C, nu is an element of V, are all nonempty and different, where B-r(nu) denotes the set of all points within distance r from nu, we call C an r-identifying code. We give bounds on the best possible density of r-identifying codes in the two-dimensional square lattice. (C) 2002 Elsevier Science (USA).
Let G = (V, E) be an undirected graph and C a subset of vertices. If the sets B-r(nu) boolean AND C, nu is an element of V, are all nonempty and different, where B-r(nu) denotes the set of all points within distance r from nu, we call C an r-identifying code. We give bounds on the best possible density of r-identifying codes in the two-dimensional square lattice. (C) 2002 Elsevier Science (USA).
UTU Research Portal