exploring the watching system of polyhedral graphs

Watching system in a graph g is a finite set w = {w1, w2, ..., wk}where each wiis a couple wi = (vi, zi), where viis a vertex andzi ⊆ ng[vi] such that {z1, ..., zk} is an identifying system.theconcept of watching system was first introduced by auger in[1]. 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.