Weakly Convex Hop Dominating Sets in Graphs

Let G be an undirected connected graph with vertex and edge sets V (G) and E(G), respectively. A set C C V (G) is called weakly convex hop dominating if for every two vertices x, y E C, there exists an x -y geodesic P(x, y) such that V (P(x, y)) C C and for every v E V(G)\C, there exists w E C such that dG(v, w) = 2. The minimum cardinality of a weakly convex hop dominating set of G, denoted by gamma wconh(G), is called the weakly convex hop domination number of G. In this paper, we introduce and initially investigate the concept of weakly convex hop domination. We show that every two positive integers a and b with 3 < a < b are realizable as the weakly convex hop domination number and convex hop domination number of some connected graph. Furthermore, we characterize the weakly convex hop dominating sets in some graphs under some binary operations.