On Minimal Geodetic Hop Domination in Graphs

Let G be a nontrivial connected graph with vertex set V (G). A set S V (G) is a geodetic hop dominating set of G if the following two conditions hold for each x V (G) S: (1) x lies in some u-v geodesic in G with u, v S, and (2) x is of distance 2 from a vertex in S. The minimum cardinality ₇₆ (G) of a geodetic hop dominating set of G is the geodetic hop domination number of G. A geodetic hop dominating set S is a minimal geodetic hop dominating set if S does not contain a proper subset that is itself geodetic hop dominating set. The maximum cardinality of a minimal geodetic hop dominating set in G is the upper geodetic hop domination number of G, and is denoted by ^+₇₆ (G). This paper initiates the study of the minimal geodetic hop dominating set and the corresponding upper geodetic hop domination number of nontrivial connected graphs. Interestingly, every pair of positive integers a and b with 2 a b is realizable as the geodetic domination number and the upper geodetic hop domination number, respectively, of some graph. Furthermore, this paper investigates the concept in the join, corona and lexicographic product of graphs.