• Kalshetti Swati Mallinath
• Laxminarayan N Kulkarni

A subset D^e of a vertex set V(G)of a graph G is said to be inverse equitable dominating set if for every vertex v∈V-D^e there exists a vertex of u ∈ D^e ,such that uv ∈E(G) and |deg(v)-deg(u) |≤1. The inverse equitable domination number of a graph G is the minimum cardinality of an inverse equitable dominating set of G and is denoted by γ^(e^(-1) ) (G).In this paper ,we study the graph theoretic properties of γ^(e^(-1) ) (G) and many bounds were obtained in terms of elements of G and its relationships with other domination parameters were found.

Equitable dominating set, Dominating set, Inverse equitable dominating set, Inverse dominating set ,Total dominating set.

"Inverse Equitable Domination in Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.8, Issue 7, page no.d260-d264, July-2021, Available :http://www.jetir.org/papers/JETIR2107421.pdf

"Inverse Equitable Domination in Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.8, Issue 7, page no. ppd260-d264, July-2021, Available at : http://www.jetir.org/papers/JETIR2107421.pdf