فهرست نشریات علمی دسترسی آزاد ایران

Watching system in a graph $G$ is a finite set $W = {w_1, w_2, ..., w_k}$ where each $w_i$ is a couple $w_i = (v_i, Z_i)$, where $v_i$ is a vertex and $Z_i \subset N_G[v_i]$ such that ${Z_1, ..., Z_k}$ is an identifying system.The concept of watching system was first introduced by Auger in [1]. and this system provide an extension of identifying code in the sense that an identifying code is a particular watching system. In this paper, we determine the watching system of specific graphs.