Definition 1. Dominating set S ⊆ V of a graph G is called neighbourhood
transversal dominating set if it intersects every minimum neighbourhood set.
The minimum cardinality of neighbourhood transversal dominating set is called
neighbourhood transversal domination number and is denoted by γnt(G). An
neighbourhood transversal dominating set S of G with |S| = γnt(G) is called a
γnt-set.