Weakly Convex Hop Dominating Sets in Graphs
Keywords:weakly convex hop dominating set, weakly convex hop domination number
Let G be an undirected connected graph with vertex and edge sets V (G) and E(G), respectively. A set C ⊆ V (G) is called weakly convex hop dominating if for every two vertices x, y ∈ C, there exists an x-y geodesic P(x, y) such that V (P(x, y)) ⊆ C and for every v ∈ V (G)\C, there exists w ∈ C such that dG(v, w) = 2. The minimum cardinality of a weakly convex hop dominating set of G, denoted by γ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.
Copyright (c) 2023 European Journal of Pure and Applied Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.