Geodetic Hop Dominating Sets in a Graph
DOI:
https://doi.org/10.29020/nybg.ejpam.v16i1.4646Keywords:
Corona, lexicograhic productAbstract
Let G be an undirected graph with vertex and edge sets V (G) and E(G), respectively. A subset S of vertices of G is a geodetic hop dominating set if it is both a geodetic and a hop dominating set. The geodetic hop domination number of G, γhg(G), is the minimum cardinality among all geodetic hop dominating sets in G. Geodetic hop dominating sets in a graph resulting from some binary operations have been characterized. These characterizations have been used to determine some tight bounds for the geodetic hop domination number of each of the graphs considered.
Downloads
Published
Issue
Section
License
Copyright (c) 2023 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.