@article {
author = {Ahmadi, S. and Vatandoost, E.},
title = {On the watching number of graphs},
journal = {Journal of the Iranian Mathematical Society},
volume = {4},
number = {2},
pages = {179-188},
year = {2023},
publisher = {Iranian Mathematical Society},
issn = {2717-1612},
eissn = {2717-1612},
doi = {10.30504/jims.2023.388523.1097},
abstract = {Let $G=(V, E)$ be a simple and undirected graph. A watcher $\omega_i$ of $G$ is a couple of $\omega_i=(v_i, Z_i),$ where $v_i \in V$ and $Z_i$ is a subset of the closed neighborhood of $v_i.$ If a vertex $v \in Z_i,$ we say that $v$ is covered by $\omega_i.$ A set $W=\{\omega_1, \omega_2, \dots, \omega_k\}$, of watchers is a watching system for $G$ if the sets $L_W(v)=\{\omega_i~:~v \in Z_i ~,~ 1 \le i \le k\}$ are non-empty and distinct, for every $v \in V$. In this paper, we study the watching systems of some graphs, and consider the watching number of Mycielski's construction of some graphs.},
keywords = {Identifying code,Watching system,Mycielski’ s construction},
url = {https://jims.ims.ir/article_174727.html},
eprint = {https://jims.ims.ir/article_174727_6ba734639bdb6c74519038ee88db437c.pdf}
}