Abstract
A set S is a 1-movable strong resolving hop dominating set of G if for every v ∈ S, either S\{v} is a strong resolving hop dominating set or there exists a vertex u ∈ (V (G)\S)∩NG(v) such that (S \ {v}) ∩ {u} is a strong resolving hop dominating set of G. The minimum cardinality of a 1-movable strong resolving hop dominating set of G is denoted by γ 1 msRh(G). In this paper, we obtained the corresponding parameter in graphs resulting from the join, corona and lexicographic product of two graphs. Specifically, we characterize the 1-movable strong resolving hop dominating sets in these types of graphs and determine the bounds or exact values of their 1-movable strong resolving hop domination numbers.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
