Grundy Total Hop Dominating Sequences in Graphs

Let G = (V (G), E(G)) be an undirected graph with γ(C) ̸= 1 for each component C of G. Let S = (v1, v2, · · · , vk) be a sequence of distint vertices of a graph G, and let Sˆ ={v1, v2, . . . , vk}. Then S is a legal open hop neighborhood sequence if N2G(vi) −1j=1 N2G(vj ) ̸= ∅for every i ∈ {2, . . . , k}. If, in addition, Sˆ is a total hop dominating set of G, then S is a Grundy total hop dominating sequence. The maximum length of a Grundy total hop dominating sequence in a graph G, denoted by γth gr(G), is the Grundy total hop domination number of G. In this paper, we show that the Grundy total hop domination number of a graph G is between the total hop domination number and twice the Grundy hop domination number of G. Moreover, determine values or bounds of the Grundy total hop domination number of some graphs.