• Kalavathi S
• Palani K

Let S be a minimum (G,D)-set in a graph G. If V-S contains a (G,D)-set S^(-1) of G, then S^(-1) is called an inverse (G,D)-set with respect to S. If V-S has no (G,D)-set, then inverse (G,D)-set does not exist in G. An inverse (G,D)-set S is called a minimum inverse (G,D)-set, if S consists of minimum number of vertices among all inverse (G,D)-sets. The number of vertices in a minimum inverse (G,D)-set is defined as the inverse (G,D)-number of a graph G, and is denoted by 〖γ_G〗^(-1) (G). If G has no inverse (G,D)-set, then it is defined as 〖γ_G〗^(-1) (G)=∞. In this paper, we initiate the study of this parameter.

Domination, Geodomination, (G, D)-set, Inverse (G, D)-set and Inverse (G, D)- number.

" Inverse (G,D) - Number of a Graph ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 7, page no.475-480, July-2018, Available :http://www.jetir.org/papers/JETIR1807222.pdf

" Inverse (G,D) - Number of a Graph ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 7, page no. pp475-480, July-2018, Available at : http://www.jetir.org/papers/JETIR1807222.pdf