Research ArticleVol. 1, No. 2 (2026)pp. 39–43
The Hop Domination Number of Comb Product Graphs
D. Anusha, S. Joseph Robin
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…