@article{Saromines_Canoy, Jr._2023, title={Geodetic Hop Dominating Sets in a Graph}, volume={16}, url={https://www.ejpam.com/index.php/ejpam/article/view/4646}, DOI={10.29020/nybg.ejpam.v16i1.4646}, abstractNote={<p>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.</p>}, number={1}, journal={European Journal of Pure and Applied Mathematics}, author={Saromines , Chrisley Jade and Canoy, Jr., Sergio}, year={2023}, month={Jan.}, pages={5–17} }