A set S ⊆ V (G) is a restrained strong resolving hop dominating in G if for every v ∈ (G)\S, there exists w such that dG(v, w) = 2 and or (G)\S has no isolated vertex. The smallest cardinality of set, denoted by γrsRh(G), called the domination number G. In this paper, we obtained corresponding parameter graphs resulting from join, corona lexicographic product two graphs. Specifically, character...