Watching Systems in graphs: an extension of Identifying Codes
Auger, David · Charon, Irène · Hudry, Olivier · Lobstein, Antoine
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.