@article{Sumaoy_Rara_2022, title={On Movable Strong Resolving Domination in Graphs}, volume={15}, url={https://www.ejpam.com/index.php/ejpam/article/view/4440}, DOI={10.29020/nybg.ejpam.v15i3.4440}, abstractNote={<p>Let G be a connected graph. A strong resolving dominating set S is a 1-movable strong resolving dominating set of G if for every v ∈ S, either S \ {v} is a strong resolving dominating set or there exists a vertex u ∈ (V (G) \ S) ∩ NG(v) such that (S \ {v}) ∪ {u} is a strong resolving dominating set of G. The minimum cardinality of a 1-movable strong resolving dominating set of G,<br />denoted by γ1 msR(G) is the 1-movable strong resolving domination number of G. A 1-movable strong resolving dominating set with cardinality γ1msR(G) is called a γ1msR-set of G. In this paper, we study this concept and the corresponding parameter in graphs resulting from the join, corona and lexicographic product of two graphs. Specifically, we characterize the 1-movable strong resolving<br />dominating sets in these types of graphs and determine the exact values of their 1-movable strong resolving domination numbers.</p>}, number={3}, journal={European Journal of Pure and Applied Mathematics}, author={Sumaoy, Helyn Cosinas and Rara, Helen}, year={2022}, month={Jul.}, pages={1201–1210} }