International Journal of Mathematics And Computer Research

Abstract

Let G = (V, E) be a graph. A non-dominating set A  V is said to be a maximal non-dominating set (mn-d-set) if every superset of A is a dominating set of G. The non-domination number  of G is the minimum cardinality taken over all mn-d-sets of G. The upper non-domination number  of G is the maximum cardinality of a non-dominating set of G. The uniform domination number u (G), is the least positive integer k such that any k-element subset of V is a dominating set of G. In this paper, we obtain a relation between non- domination number and uniform domination number