| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654997 | European Journal of Combinatorics | 2006 | 10 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Iiro Honkala, Tero Laihonen,