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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
