A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Let G = (V, E) be a graph and uv ∈ E be an edge then v weakly dominates u if deg(v) ≤ deg(u). A set S is a weak dominating set (wd − set) if every vertex u ∈ V − S is weakly dominated by some v in S. The weak domination number γ w (G) of G is the minimum cardinality of a weak dominating set. We investigate weak domination number of some corona related graphs.fatcat:3thuqfrel5cxniglovrcvgviui