On Restrained 2-Domination Number of the Join and Corona of Graphs
Esamel M. Paluga, Rolando N. Paluga · IOSR Journal of Mathematics · 2014
is adjacent to at least two vertices of S and every, is the smallest cardinality of a restrained 2 -dominating set G .In this paper, we characterize the graphs obtained in the join of two graphs having. We also characterize restrained 2 -dominating sets in the corona of two graphs and give a formula for computing the restrained 2 -domination number.