ON WEAK DOMINATION NUMBER OF SOME GRAPHS
Let be a graph and be an edge. Then v weakly dominates u if A set is a weak dominating set (wd-set) of G if every vertex is weakly dominated by at least one vertex in S. The weak domination number of G is the minimum cardinality of a weak dominating set. In this paper,we discuss the bounds for weak domination number and the weak domination number of some path related graphs.
domination number, independent domination number, weak domination number.