Let G(V ,E) be a network, where V is the set of nodes of G and E is the set of edges of G. A dominating set (DS) of graph G is a subset S(V of the nodes such that for all nodes v[V , either v[S or a neighbor u of v is in S. A dominating set is said to be minimal if it contains no proper subset that is dominating and it is said to be minimum if it is of the smallest cardinality. The cardinality of a minimum dominating set of graph G, c(G), is called the domination number of G. It has been shown that for graph G with jV j nodes: