On locating-dominating sets in infinite grids




Honkala I, Laihonen T

PublisherACADEMIC PRESS LTD ELSEVIER SCIENCE LTD

2006

European Journal of Combinatorics

EUROPEAN JOURNAL OF COMBINATORICS

EUR J COMBIN

27

2

218

227

10

0195-6698

DOIhttps://doi.org/10.1016/j.ejc.2004.09.002



Determining a malfunctioning component in a processor network gives the motivation for locating-dominating sets. It is shown that the smallest possible density of a locating-dominating set in the king grid equals 1/5 and in the hexagonal mesh 1/3. Moreover, we discuss a natural modification of locating-dominating sets. (C) 2004 Elsevier Ltd. All rights reserved.



Last updated on 2024-26-11 at 23:13