Vertaisarvioitu alkuperäisartikkeli tai data-artikkeli tieteellisessä aikakauslehdessä (A1)
An optimal strongly identifying code in the infinite triangular grid
Julkaisun tekijät: Honkala Iiro
Kustantaja: ELECTRONIC JOURNAL OF COMBINATORICS
Julkaisuvuosi: 2010
Journal: The Electronic Journal of Combinatorics
Tietokannassa oleva lehden nimi: ELECTRONIC JOURNAL OF COMBINATORICS
Lehden akronyymi: ELECTRON J COMB
Artikkelin numero: R91
Numero sarjassa: 1
Volyymi: 17
Julkaisunumero: 1
Sivujen määrä: 10
ISSN: 1077-8926
Verkko-osoite: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r91
Rinnakkaistallenteen osoite: https://research.utu.fi/converis/portal/Publication/1873118
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.
Ladattava julkaisu This is an electronic reprint of the original article. |  |
