Inverse domination parameters of some graph transformation

A set D of vertices in a graph G(V, E) is a dominating set of G , if every vertex in V - D is adjacent to at least one vertex in D. If V - D contains a dominatingset D′ of G then D′ is called an inverse dominating set with respect to D. In this paper we have established some theorems and properties of the inverse domination parameters to the transformation of path (by removing any one edge), platonic solidtetrahedron, platonic solid cube, platonic solid Octahedron.