Convex Hop Domination in Graphs


  • Javier Hassan MSU-Iligan Institute of Technology, 9200, Iligan City, Philippines
  • Sergio Canoy, Jr.
  • Chrisley Jade Saromines



hop domination, convex hop dominating set, 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 convex hop dominating if for every two vertices x, y ∈ C, the vertex set of every x-y geodesic is contained in C and for every v ∈ V (G) \ C, there exists w ∈ C such that dG(v, w) = 2. The minimum cardinality of convex hop dominating set of G, denoted by γconh(G), is called the convex hop domination number of G. In this paper, we show that every two positive integers a and b, where 2 ≤ a ≤ b, are realizable as the connected hop domination number and convex hop domination number, respectively, of a connected graph. We also characterize the convex hop dominating sets in some graphs and determine their convex hop domination numbers.


How to Cite

Hassan, J., Canoy, Jr., S., & Saromines, C. J. (2023). Convex Hop Domination in Graphs. European Journal of Pure and Applied Mathematics, 16(1), 319–335.

Most read articles by the same author(s)