Identifying and locating-dominating codes on chains and cycles

  title={Identifying and locating-dominating codes on chains and cycles},
  author={Nathalie Bertrand and Ir{\`e}ne Charon and Olivier Hudry and Antoine Lobstein},
  journal={Eur. J. Comb.},
Consider a connected undirected graph G = (V, E), a subset of verticesC ⊆ V , and an integer r ≥ 1; for anyvertexv ∈ V , let Br (v) denote the ball of radius r centered atv, i.e., the set of all vertices within distancer from v. If for all verticesv ∈ V (respectively,v ∈ V\C), the sets Br (v) ∩ C are all nonempty and different, then we call C an r -identifying code (respectively, an r -locating-dominating code). We study the smallest cardinalities or densities of these codes in chains (finite… CONTINUE READING
43 Citations
10 References
Similar Papers


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


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

Codes identifiants, Ra pport pour le DEA ROCO

  • M. Daniel
  • 2003
1 Excerpt

Minimizing thesize ofan identifying or locating - dominating code in a graph is NP - hard , Theoret

  • O. Hudry Charon, A. Lobstein
  • Comput . Sci .
  • 2003

Locating dominating sets and locating-dominating

  • P. J. Slat er
  • Graph Theory, Combinatorics and Applications…
  • 1995
1 Excerpt

Dominating and referenc sets in a graph

  • P. J. Slater
  • J. Math. Phys. Sci
  • 1988
2 Excerpts

Locating dom inating sets in series parallel networks

  • C. J. Colbourn, P. J. Slater, L. K. Stewart
  • Congr. Numer
  • 1987
2 Excerpts

Similar Papers

Loading similar papers…