Geodetic Hop Dominating Sets in a Graph

Authors

  • Chrisley Jade Saromines Mindanao State University - Iligan Institute of Technology
  • Sergio Canoy, Jr. Mindanao State University-Iligan Institute of Technology

DOI:

https://doi.org/10.29020/nybg.ejpam.v16i1.4646

Keywords:

Corona, lexicograhic product

Abstract

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

How to Cite

Saromines , C. J. ., & Canoy, Jr., S. (2023). Geodetic Hop Dominating Sets in a Graph. European Journal of Pure and Applied Mathematics, 16(1), 5–17. https://doi.org/10.29020/nybg.ejpam.v16i1.4646

Issue

Vol. 16 No. 1: (January 2023)

License

Copyright (c) 2023 European Journal of Pure and Applied Mathematics

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.

European Journal of Pure and Applied Mathematics will be Copyright Holder.