Grundy Hop Domination in Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v15i4.4511Keywords:
Hop domination, hop domination number, closed hop neighborhood sequenceAbstract
Let G be an undirected graph with vertex and edge sets V (G) and E(G), respectively. Let S = (v1, v2, · · · , vk) be a sequence of distinct vertices of G and let Sˆ = {v1, v2, . . . , vk}. Then S is a legal closed hop neighborhood sequence of G if N2 G[vi]\∪i−1j=1N 2 G[vj ] ̸= ∅ for each i ∈ {2, · · · , k}. If, in addition, Sˆ is a hop dominating set of G, then S is called a Grundy hop dominating sequence.
The maximum length of a Grundy hop dominating sequence in a graph G, denoted by γ hgr(G), is called the Grundy hop domination number of G. In this paper, we determine some (extreme) values for the Grundy hop domination number. It is pointed out that the Grundy hop domination number is at least equal to the hop domination. Bounds for the Grundy hop domination numbers
of some graphs resulting from some binary operations of two graphs are also obtained.
Downloads
Published
Issue
Section
License
Copyright (c) 2022 European Journal of Pure and Applied Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International 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.