Inverse Odd Neighbor in D^{-1}^c Domination Number in Graphs

In this paper, we introduce a new definition of an inverse domination number called an inverse odd neighbor in D^{- 1}^c domination number. For any connected graph G, D is a minimum odd neighbor in D^c dominating set if D^c has a dominating set, say D^{-1}, with vertices dominating to an odd number of vertices in D^{-1}^c. This set is called an inverse odd neighbor in D^{-1}^c domination number.