Global Hop Domination Numbers of Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v14i1.3916Keywords:
hop domination, global hop domination, join, corona, lexicographic product, and Cartesian productAbstract
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.
Â
Downloads
Published
Issue
Section
License
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.