Weakly Convex Hop Dominating Sets in Graphs

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