Watching systems in graphs: An extension of identifying codes

Watching systems in graphs: An extension of identifying codes

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 th...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 161; no. 12; pp. 1674 - 1685
Main Authors: Auger, David, Charon, Irène, Hudry, Olivier, Lobstein, Antoine
Format: Journal Article
Language:English
Published: Elsevier B.V 01-08-2013
Subjects:
Complexity
Cycles
Graph theory
Graphs
Identifying codes
Mathematical analysis
Paths
Upper bounds
Watching systems
Watching systems
Cycles
Graph theory
Paths
Identifying codes
Complexity
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2011.04.025