Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs

Kaustav Paul, Ankit Sharma, Arti Pandey

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