THE FORCING HOP DOMINATION NUMBER OF A GRAPH
Let S be a -set of G. A subset T of S is called a forcing subset of S if S is the unique -set containing T. The minimum cardinality of T is the forcing hop domination number of S and is denoted by The forcing hop domination number of G is where the minimum is taken over all -sets of G. Some general properties satisfied by this concept are studied. It is shown for every pair a, b of integers with and there exists a connected graph G such that and where -set is minimum hop dominating set of G.
distance, hop domination number, forcing hop domination number.