[1] D. Auger, I. Charon, O. Hudry, A. Lobstein, Maximum size of a minimum watching system and
the graphs achieving the bound, Disc. Appl. Math. 164 (2014) 20–33
[2] D. Auger, I. Charon, O. Hurdy and A. Lobstein, Watching systems in graphs: an extension of
identifying codes, Disc. Appl. Math. 161 (2013) 1674–1685.
[3] M. Ghorbani, M. Dehmer, H. Maimani, S. Maddah, M. Roozbayani, F. Emmert-Streib, The watching system as a generalization of identifying code, Appl. Math. and Comp. 380 (2020) 125302.
[4] S. Maddah, M. Ghorbani, On the watching number of graphs using discharging procedure, Jur. of
Appl. Math. and Comp. (2021) 1–12.
[5] S. Maddah, M. Ghorbani, M. Dehmer, New results of identifying codes in product graphs, Appl.
Math. and Comp. 410 (2021) 126438.
)
)