Hop Independent J-Domination in Graphs.
Let G be a graph with vertex-set and edge-set V(G) and E(G), respectively. Then S \subseteq V(G) is a hop independent J-dominating if S is both a hop independent and J-dominating set of G. The maximum cardinality of a hop independent J-dominating set of G, denoted by \gamma^{hi}_{J}(G) is the hop independent J-dominati...