Eternal distance-k domination on graphs

TL;DR

This paper extends the concept of eternal domination to distance-$k$ on graphs, analyzing its computational complexity and providing bounds and exact results for specific graph classes like paths, cycles, and trees.

Contribution

It introduces the concept of eternal distance-$k$ domination for $k > 1$, explores its complexity, and provides bounds and solutions for various graph classes.

Findings

Determining eternal distance-$k$ domination is in EXP complexity.

Bounds established for trees and perfect $m$-ary trees.

Results relate eternal domination to graph powers and general domination.

Abstract

Eternal domination is a dynamic process by which a graph is protected from an infinite sequence of vertex intrusions. In eternal distance-$k$ domination, guards initially occupy the vertices of a distance-$k$ dominating set. After a vertex is attacked, guards ``defend'' by each moving up to distance $k$ to form a distance-$k$ dominating set, such that some guard occupies the attacked vertex. The eternal distance-$k$ domination number of a graph is the minimum number of guards needed to defend against any sequence of attacks. The process is well-studied for the situation where $k=1$. We introduce eternal distance-$k$ domination for $k > 1$. Determining whether a given set is an eternal distance-$k$ domination set is in EXP, and in this paper we provide a number of results for paths and cycles, and relate this parameter to graph powers and domination in general. For trees we use decomposition arguments to bound the eternal distance-$k$ domination numbers, and solve the problem entirely in the case of perfect $m$-ary trees.