Movable Restrained-Domination in the Corona of Graphs

Let G be a simple connected graph. A dominating set S subset of V (G) of G is a restrained dominating set in G if for every v is an element of V (G)\S there exists u is an element of V (G)\S such that u v is an element of E (G). A restrained dominating set S of G is a 1-movable restrained-dominating set of G if for every v is an element of S either S\ {v}is a restrained dominating set of G or there exists u is an element of (V (G)\S) boolean AND N(v) such that (S\ {v})boolean OR {u} is a re-strained dominating set of G. The minimum cardinality of a 1-movablerestrained-dominating set in G, denoted by gamma(1)(mr)(G),is the 1-movablerestrained-domination number of G. In this paper, the 1-movable restrained-dominating sets in the corona of graphs are characterized. Also, the 1-movable restrained-domination numbers of these graphs are determined.