Open neighborhood locating dominating sets

  title={Open neighborhood locating dominating sets},
  author={Suk Jai Seo and Peter J. Slater},
  journal={Australasian J. Combinatorics},
For a graph G that models a facility, various detection devices can be placed at the vertices so as to identify the location of an intruder such as a thief or saboteur. Here we introduce the open neighborhood locating-dominating set problem. We seek a minimum cardinality vertex set S with the property that for each vertex v its open neighborhood N(v) has a unique non-empty intersection with S. Such a set is an OLD(G)-set. Among other things, we describe minimum density OLD-sets for various… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
18 Citations
16 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 18 extracted citations


Publications referenced by this paper.
Showing 1-10 of 16 references

Locating dominating sets and locating-dominating sets

  • P. J. Slater
  • in: Graph Theory, Combinatorics, and Applications…
  • 1995
1 Excerpt

On generalized location domination

  • D. I. Carson
  • in: Graph Theory, Combinatorics, and Applications…
  • 1995
1 Excerpt

Dominating and reference sets in a graph

  • P. J. Slater
  • J. Math. Phys. Sciences 22
  • 1988
1 Excerpt

Similar Papers

Loading similar papers…