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.