A set D of vertices in a graph ????(????, ????) is a dominating set of ???? , if every vertex ???? ∈ ???? − ???? is adjacent to at least one vertex in D . If ???? − ???? contains a dominating set ????′ of ???? then ????′ is called an inverse dominating set with respect to ????. In this paper we have established some theorems and properties of the inverse domination parameters to the transformation of path (by removing any one vertex) and cubic symmetric graph.