%0 Journal Article
%T Watching systems of triangular graphs
%J Transactions on Combinatorics
%I University of Isfahan
%Z 2251-8657
%A Roozbayani, Maryam
%A Maimani, Hamidreza
%A Tehranian, Abolfazl
%D 2014
%\ 03/01/2014
%V 3
%N 1
%P 51-57
%! Watching systems of triangular graphs
%K Identifying code
%K Watching system
%K Triangular graph
%R 10.22108/toc.2014.4127
%X A watching system in a graph $G=(V, E)$ is a set $W=\{\omega_{1}, \omega_{2}, \dots, \omega_{k}\}$, where $\omega_{i}=(v_{i}, Z_{i}), v_{i}\in V$ and $Z_{i}$ is a subset of closed neighborhood of $v_{i}$ such that the sets $L_{W}(v)=\{\omega_{i}: v\in Z_{i}\}$ are non-empty and distinct, for any $v\in V$. In this paper, we study the watching systems of line graph $K_{n}$ which is called triangular graph and denoted by $T(n)$. The minimum size of a watching system of $G$ is denoted by $\omega(G)$. We show that $\omega(T(n))=\lceil\frac{2n}{3}\rceil$.
%U https://toc.ui.ac.ir/article_4127_d8e4a0adef0fedf9f732d00d5f2d641f.pdf