We study the eternal dominating number and the m-eternal dominating number on digraphs. We generalize known results on graphs to digraphs. We also consider the problem "oriented (m-)eternal domination", consisting in finding an orientation of a graph that minimizes its eternal dominating number. We prove that computing the oriented eternal dominating number is NP-hard and characterize the graphs for which the oriented m-eternal dominating number is 2. We also study these two parameters on trees, cycles, complete graphs, complete bipartite graphs, trivially perfect graphs and different kinds of grids and products of graphs.
Recently, the eternal domination game and a variant have been studied in digraphs, including orientations of grids and toroidal strong grids REF .
Eternal dominating sets on digraphs and orientations of graphs
ArXiv
ArXiv
Computer Science Mathematics