Watching Systems in graphs: an extension of Identifying Codes
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2010
- arXiv:
- arXiv:1005.0765
- Bibcode:
- 2010arXiv1005.0765A
- Keywords:
-
- Computer Science - Discrete Mathematics;
- Mathematics - Combinatorics