Algorithm and hardness results on neighborhood total domination in graphs

Anupriya Jha, D. Pradhan, S. Banerjee

A set $D\subseteq V$ of a graph $G=(V,E)$ is called a neighborhood total dominating set of $G$ if $D$ is a dominating set and the subgraph of $G$ induced by the open neighborhood o…