Sheyda Maddah - Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, ۱۶۷۸۵-۱۶۳, I. R. Iran

Watching system in a graph G is a finite set W = {w۱, w۲, ..., wk}where each wiis a couple wi = (vi, Zi), where viis a vertex andZi ⊆ NG[vi] such that {Z۱, ..., Zk} is an identifying system.Theconcept of watching system was first introduced by Auger in[۱]. and this system provide an extension of identifying codein the sense that an identifying code is a particular watchingsystem. In this paper, we determine the watching system ofspecific graphs.

Watching systems, generelized Peteersen graph, identifying codes