HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Watching systems in graphs: an extension of identifying codes

David Auger 1 Irène Charon 2, 3 Olivier Hudry 2, 3 Antoine Lobstein 2, 3, *
* Corresponding author
1 MAGMAT
LTCI - Laboratoire Traitement et Communication de l'Information, Télécom ParisTech
Abstract : We introduce the notion of watching systems in graphs, which is a generalization of that of identifying codes. We give some basic properties of watching systems, an upper bound on the minimum size of a watching system, and results on the graphs which achieve this bound; we also study the cases of the paths and cycles, and give complexity results.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00481469
Contributor : Olivier Hudry Connect in order to contact the contributor
Submitted on : Thursday, May 6, 2010 - 4:46:28 PM
Last modification on : Monday, January 24, 2022 - 11:43:20 AM
Long-term archiving on: : Thursday, September 16, 2010 - 1:42:45 PM

File

Auger-Charon-Hudry-Lobstein_wa...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00481469, version 1

Citation

David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein. Watching systems in graphs: an extension of identifying codes. 2010. ⟨hal-00481469⟩

Share

Metrics

Record views

155

Files downloads

227