The Hop Domination Number of Comb Product Graphs

A set S ⊆ V of a graph G is a hop dominating set of G if for every v ∈ V − S, there exists u ∈ S such that d(u, v) = 2. The minimum cardinality of a hop dominating set of G is called the hop domination number and is denoted by γₕ(G). Any hop dominating set of order γₕ(G) is called a γₕ-set of G. In this paper, we study the concept of the hop domination number of the comb product of some standard graphs.