INVERSE DOMINATION IN GRAPHS

Abstract

A set D of vertices in a graph G is a dominating set if every vertex not in D is adjacent to at least one vertex in D. Let D be a minimum dominating set of G. If V-D contains a dominating set say D' of G, then D' is called an inverse dominating set with respect to D. The inverse domination number gamma' (G) of G is the order of a smallest inverse dominating set of G. In this communication, we obtain the exact values of gamma' (G) for some standard graphs and also, we establish some general results on this parameter.