Algorithm and hardness results on neighborhood total domination in graphs (Q2201995)

A set \(D \subseteq V\) is a dominating set in a graph \(G=(V,E)\) if \(\bigcup_{v \in D} N[v] = V\). The set \(D\) is total dominating if \(\bigcup_{v \in D} N(v) = V\). That is, the dominating set \(D\) is total dominating if \(G[D]\) has no isolated vertex. Finally, the dominating set \(D\) is neighbourhood total dominating if \(G[\bigcup_{v \in D} N(v)]\) has no isolated vertex. Every total dominating set is neighbourhood total dominating, and every neighbourhood total dominating set is dominating. Some complexity results on finding minimum neighbourhood total dominating sets are carried over from analogous results on minimum dominating sets.