INVERSE DOMINATION NUMBER OF CIRCULANT GRAPH G(n; ± {1, 2, 3})

A set D of vertices in a graph G, is a dominating set, if every vertex in V\D is adjacent to atleast one vertex in D. A dominating set is called a minimum dominating set, if D consists of minimum number of vertices among all the dominating set. If V\D contains dominating set D' of G, then D' is called an inverse dominating set. An inverse dominating set D' is called a minimum inverse dominating set, if D' consists of minimum number of vertices among all the inverse dominating set. The number of vertices in a minimum inverse dominating set is defined as inverse domination number of a graph G and it is denoted by gamma(-1)(G). In this paper we investigate the inverse domination number of circulant graph.