On the $nk-attack Roman Dominating Number of a Graph

Garrison Koch, Nathan Shank

Given a graph $G=(V,E)$, the dominating number of a graph is the minimum size of a vertex set, $V^{\prime }\subseteq V$, so that every vertex in the graph is either in $V^{\prime }$ or is adjacent…