Convex Hop Domination in Graphs

Abstract

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.

2-distance Zero Forcing Sets in Graphs

“…Moreover, they have obtained some exact values or bounds of the parameter on the generalized graph, some families of graphs, and graphs under some operations via characterizations. Some interesting studies related to zero forcing hop domination can be found in [7][8][9][10][11][12][13][14][15].…”

Legal Hop Independent Sequences in Graphs

“…Moreover, they derived some bounds and formulas for some special graphs and graphs under some binary operations. Some studies related to hop independent sets, its variations, and other hop-related concepts can be found in [3,9,10,13,14].…”

Certified Vertex Cover of a Graph

“…Moreover, they have characterized the vertex cover hop dominating sets in some special graphs, join, and corona of two graphs, and obtained the exact values or bounds of the parameter of these graphs. Some studies related to vertex cover hop domination can be found in [2][3][4][5][6][7][8][9][10][11].…”