Watching Systems in graphs: an extension of Identifying Codes
classification
💻 cs.DM
math.CO
keywords
watchinggraphssystemsboundcodesgiveidentifyingresults
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.