Algorithmic Results for Weak Roman Domination Problem in Graphs

Kaustav Paul, Ankit Sharma, Arti Pandey

Consider a graph $G=(V,E)$ and a function $f:V\to \{0,1,2\}$. A vertex $u$ with $f(u)=0$ is defined as \emph{undefended} by $f$ if it lacks adjacency to any vertex w…