On locating–dominating sets in infinite grids

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.