On the domination search number ?
We introduce the domination search game which can be seen as a natural modification of the well-known node search game. Various results concerning the domination search number of a graph are presented. In particular, we establish a very interesting connection between domination graph searching and a relatively new graph parameter called dominating target number.
domination graph searching dominating target asteroidal triple-free graph