On the complexity of global Roman domination problem in graphs

Sangam Balchandar Reddy, Arun Kumar Das, Anjeneya Swami Kare +1

A Roman dominating function of a graph $G=(V,E)$ is a labeling $f:V\to \{0,1,2\}$ such that for each vertex $u\in V$ with $f(u)=0$, there exists a vertex $v \in N(…