$m$-Eternal Dominating Set Problem on Subclasses of Chordal Graphs

Ashutosh Rai, Soumyashree Rana

A dominating set of a graph G(V, E) is a set of vertices D\subseteq V such that every vertex in V\D has a neighbor in D. An eternal dominating set extends this concept by placing m…