(Independent) Roman Domination Parameterized by Distance to Cluster

Pradeesha Ashok, Gautam K. Das, Arti Pandey +2

Given a graph $G=(V,E)$, a function $f:V\to \{0,1,2\}$ is said to be a \emph{Roman Dominating function} (RDF) if for every $v\in V$ with $f(v)=0$, there exists a vertex $u\in N(v)$…