A dominating set of a graph G which intersects every independent set of a maximum cardinality in G is called an independent transversal dominating set. The minimum cardinality of an independent transversal dominating set is called the independent transversal domination number of G and is denoted by γ (G). In this paper we investigate the independent transversal domination number of the path graph it P n with the star graph S 1,m , the wheel graph W 1,m and the complete graph K n under neihgbourhood corona, edge corona and join operation providing β(P ) > β(G).