Computing m-Eternal Domination Number of Cactus Graphs in Linear Time

Václav Blažej, Jan Matyáš Křišťan, Tomáš Valla

In m-eternal domination attacker and defender play on a graph. Initially, the defender places guards on vertices. In each round, the attacker chooses a vertex to attack. Then, the…