Revisiting Domination, Hop Domination, and Global Hop Domination in Graphs

Gemma Puebla Salasalan, Sergio R Canoy, Jr


A set S ⊆ V (G) is a hop dominating set of G if for each v ∈ V (G) \ S, there exists w ∈ S such that dG(v, w) = 2. It is a global hop dominating set of G if it is a hop dominating set of both G and the complement  of G. The minimum cardinality of a hop dominating (global hop dominating) set of G, denoted by γh(G)(resp.γgh(G))
, is called the hop domination (resp. global hop domination) number of G. In this paper, we give some realization results involving domination, hop domination, and global hop domination parameters. Also, we give a rectification of a result found in a recent paper of the authors and use this to prove some results in this paper.




domination, hop domination, global hop domination, complementary prism, shadow graph

Full Text: