A dominating set T in a graph G is called neighbourhood transversal dominating set of G if it intersects every minimum neighbourhood set of G. The minimum cardinality of neighbourhood transversal dominating set in G is called neighbourhood transversal domination number of G denoted by  In this paper, we obtain the neighbourhood transversal domination number of some special graphs, namely:  and

neighbourhood transversal domination, neighbourhood transversal domination number.