Complexity Issues Concerning the Quadruple Roman Domination Problem in Graphs

V. S. R. Palagiri, G. P. Sharma, I. G. Yero

Given a graph $G$ with vertex set $V(G)$, a mapping $h:V(G)\to \{0,1,2,3,4,5\}$ is called a quadruple Roman dominating function (4RDF) for $G$ if it hol…