A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä

An optimal locating-dominating set in the infinite triangular grid




TekijätHonkala I

KustantajaELSEVIER SCIENCE BV

Julkaisuvuosi2006

JournalDiscrete Mathematics

Tietokannassa oleva lehden nimiDISCRETE MATHEMATICS

Lehden akronyymiDISCRETE MATH

Vuosikerta306

Numero21

Aloitussivu2670

Lopetussivu2681

Sivujen määrä12

ISSN0012-365X

DOIhttps://doi.org/10.1016/j.disc.2006.04.028


Tiivistelmä
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 all the sets I (v) for v is an element of V\C are non-empty, and pairwise different, then C is called a locating-dominating set. The smallest possible density of a locating-dominating set in the infinite triangular grid is shown to be (13)/(57) (c) 2006 Elsevier B.V. All rights reserved.


Research Areas



Last updated on 2024-26-11 at 14:37