A1 Refereed original research article in a scientific journal
An optimal strongly identifying code in the infinite triangular grid
Authors: Honkala Iiro
Publisher: ELECTRONIC JOURNAL OF COMBINATORICS
Publication year: 2010
Journal: The Electronic Journal of Combinatorics
Journal name in source: ELECTRONIC JOURNAL OF COMBINATORICS
Journal acronym: ELECTRON J COMB
Article number: R91
Number in series: 1
Volume: 17
Issue: 1
Number of pages: 10
ISSN: 1077-8926
Web address : http://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r91(external)
Self-archived copy’s web address: https://research.utu.fi/converis/portal/Publication/1873118(external)
Assume that G = (V, E) is an undirected graph, and C subset of V. For every v is an element of V, we denote by I(v) the set of all elements of C that are within distance one from v. If the sets I(v){v} for v is an element of V are all nonempty, and, moreover, the sets {I(v), I(v){v}} for v is an element of V are disjoint, then C is called a strongly identifying code. The smallest possible density of a strongly identifying code in the infinite triangular grid is shown to be 6/19.
Downloadable publication This is an electronic reprint of the original article. |  |
