@article {IOPORT.01018488,
    author       = {Sampathkumar, E. and Pushpa Latha, L.},
    title        = {Strong weak domination and domination balance in a graph.},
    year         = {1996},
    journal      = {Discrete Mathematics},
    volume       = {161},
    number       = {1-3},
    issn         = {0012-365X},
    pages        = {235-242},
    publisher    = {Elsevier Science B.V. (North-Holland), Amsterdam},
    doi          = {10.1016/0012-365X(95)00231-K},
    abstract     = {Summary: Let $G=(V,E)$ be a graph and $u,v\in V$. Then, $u$ strongly dominates $v$ and $v$ weakly dominates $u$ if (i) $uv\in E$ and (ii) $\deg u\geq\deg v$. A set $D\subset V$ is a strong-dominating set (sd-set) of $G$ if every vertex in $V-D$ is strongly dominated by at least one vertex in $D$. Similarly, a weak-dominating set (wd-set) is defined. The strong (weak) domination number $\gamma_{\text{s}}$ $(\gamma_{\text{w}})$ of $G$ is the minimum cardinality of an sd-set (wd-set). Besides investigating some relationship of $\gamma_{\text{s}}$ and $\gamma_{\text{w}}$ with other known parameters of $G$, some bounds are obtained. A graph $G$ is domination balanced if there exists an sd-set $D_1$ and a wd-set $D_2$ such that $D_1\cap D_2=\varnothing$. A study of domination balanced graphs is initiated.},
    identifier   = {01018488},
}