NEW PARAMETERS ON INVERSE DOMINATION

A set D of vertices in a graph G(V, E) is a dominating set of G, if every vertex of V not in D is adjacent to at least one vertex in D. A dominating set D of G(V, E)is a k – fair dominating set of G, for ???? ≥ 1 if every vertex in V – D is adjacent to exactly k vertices in D. The k – fair domination number ????????????????(????) of G is the minimum cardinality of a k – fair dominating set. In this article, we define the inverse of the k – fair domination number and try to find it for some class of graphs