Hop Differentiating Hop Dominating Sets in Graphs

A subset S of V (G), where G is a simple undirected graph, is hop dominating if for each v is an element of V (G) \ S, there exists w is an element of S such that d(G)(v, w) = 2 and it is hop differentiating if N-G(2)[u] boolean AND S = N2G[v] n S for any two distinct vertices u, v is an element of V (G). A set S subset of V (G) is hop differentiating hop dominating if it is both hop differentiating and hop dominating in G. The minimum cardinality of a hop differentiating hop dominating set in G, denoted by gamma(dh)(G), is called the hop differentiating hop domination number of G. In this paper, we investigate some properties of this newly defined parameter. In particular, we characterize the hop differentiating hop dominating sets in graphs under some binary operations.