The identifying code has been used to place objects in the sensor and wireless networks. For the vertex x of a graph G, suppose \(N_G[x]\) is a subset of V(G) containing x and all of its neighbors. Then \(C\subseteq V(G)\) is called an identifying code of G, if for two distinct vertices x and y of G, both \(C\cap N_G[x]\) and \(C\cap N_G[y]\) are nonempty and distinct. The watching system of a graph G has been proposed as an extension of identifying code. In this paper, we study some properties of watching system and then, by using a discharging method, we compute the watching of generalized Petersen graph P(n, k) (for \(k=2,3,n/2\)) which is commonly used in interconnection networks.

识别码已用于将物体放置在传感器和无线网络中。对于图G的顶点x，假设\（N_G [x] \）是V（G）的子集，其中包含x及其所有邻居。然后\（C \ subseteq V（G）\）被称为的识别代码ģ，如果用于两个不同的顶点X和ÿ的ģ，既\（C \帽N_G [X] \）和\（C \帽N_G [y] \）是非空且不同的。图G的监视系统已经提出将其作为识别码的扩展。在本文中，我们研究了监视系统的一些特性，然后通过一种放电方法，计算了广义Petersen图P（n，  k）的监视（对于\（k = 2,3，n / 2 \））这是互连网络中常用的。