Author:
Salasalan Gemma,Canoy, Jr Sergio
Abstract
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 dominatingset of both G and the complement of G. The minimum cardinality of a global hop dominatingset of G, denoted by γgh(G), is called the global hop domination number of G. In this paper, we study the concept of global hop domination in graphs resulting from some binary operations.Â
Publisher
New York Business Global LLC
Subject
Applied Mathematics,Geometry and Topology,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,Theoretical Computer Science
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Minimal Geodetic Hop Domination in Graphs;European Journal of Pure and Applied Mathematics;2024-07-31
2. Differentiating Odd Dominating Sets in Graphs;European Journal of Pure and Applied Mathematics;2024-07-31
3. Polynomial Representation and Degree Sequence of Graphs Resulting from Some Graph Operations;European Journal of Pure and Applied Mathematics;2024-07-31
4. Further results on the hop domination number of a graph;Boletim da Sociedade Paranaense de Matemática;2024-05-03
5. Vertex Cover Hop Dominating Sets in Graphs;European Journal of Pure and Applied Mathematics;2024-01-31