Watching Systems in graphs: an extension of Identifying Codes

Details Watching Systems in graphs: an extension of Identifying Codes Watching Systems in graphs: an extension of Identifying Codes

2010-05-05

arxiv.org/abs/1005.0765v1

Computer Science

Discrete Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Watching Systems in graphs: an extension of Identifying Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Watching Systems in graphs: an extension of Identifying Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Watching Systems in graphs: an extension of Identifying Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-437204