@article{Saromines_Canoy Jr._2023, title={Another Look at Geodetic Hop Domination in a Graph}, volume={16}, url={https://ejpam.com/index.php/ejpam/article/view/4810}, DOI={10.29020/nybg.ejpam.v16i3.4810}, 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$ is the minimum cardinality among all geodetic hop dominating sets in $G$. Geodetic hop dominating sets in a graph resulting from the join of two graphs have been characterized. These characterizations have been used to determine the geodetic hop domination number of the graphs considered. A realization result involving the hop domination number and geodetic hop domination number is also obtained.</p>}, number={3}, journal={European Journal of Pure and Applied Mathematics}, author={Saromines , Chrisley Jade and Canoy Jr. , Sergio}, year={2023}, month={Jul.}, pages={1568–1579} }