Work

Watching Systems in graphs: an extension of Identifying Codes

Year: 2010

Type: preprint

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.

DOI: 10.48550/arxiv.1005.0765

Authors: Auger, David, Charon, Irène, Hudry, Olivier, Lobstein, Antoine

Institutions: Centre National de la Recherche Scientifique, ParisTech, Laboratoire Traitement et Communication de l’Information, Télécom Paris

Language: English

Topic: Graph Labeling and Dimension Problems

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2963209796

Cites: 25

Cited by: 2

Related to: 10