SOME RESULTS ON WEAK DOMINATION IN GRAPHS
For the graph G and we say u weakly dominates v or v strongly dominates u if A subset isa weak(strong) dominating set if every vertex is weakly(strongly) dominated by some u in D. The weak(strong) domination number is the minimum cardinality of a We investigate weak domination number of some graphs.
domination number, weak domination number, independent weak domination number.