On 2-Resolving Hop Dominating Sets in the Join, Corona and Lexicographic Product of Graphs

Let G be a connected graph. A set S of vertices in G is a 2-resolving hop dominating set of G if S is a 2-resolving set in G and for every vertex x is an element of V(G)\S, there exists y is an element of S such that dG(x, y) = 2. The minimum cardinality of a set S is called the 2-resolving hop domination number of G and is denoted by gamma 2Rh(G). This study aims to combine the concept of hop domination with the 2-resolving sets of graphs. The main results generated in this study include the characterization of 2-resolving hop dominating sets in the join, corona and lexicographic product of two graphs, as well as their corresponding bounds or exact values.