A sequence of vertices in a graph G with no isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at least one vertex that was not totally dominated by preceding vertices in the sequence, and, at the end all vertices of G are totally dominated (by definition a vertex totally dominates its neighbors). The maximum length of a total dominating sequence is called the Grundy total domination number, γ t gr (G), of G, as introduced in [B. Brešar, M. A. Henning, and D. F. Rall, Total dominating sequences in graphs, Discrete Math. 339 (2016), 1165-1676]. In this paper we continue the investigation of this concept, mainly from the algorithmic point of view. While it was known that the decision version of the problem is NP-complete in bipartite graphs, we show that this is also true if we restrict to split graphs. A linear time algorithm for determining the Grundy total domination number of an arbitrary tree T is presented, based on the formula γ t gr (T ) = 2τ (T ), where τ (T ) is the vertex cover number of T . A similar efficient algorithm is presented for bipartite distancehereditary graphs. Using the modular decomposition of a graph, we present a frame for obtaining polynomial algorithms for this problem in classes of graphs having relatively simple modular subgraphs. In particular, a linear algorithm for determining the Grundy total domination number of P4-tidy graphs is presented. In addition, we prove a realization result by exhibiting a family of graphs G k such that γ t gr (G k ) = k, for any k ∈ Z + \ {1, 3}, and showing that there are no graphs G with γ t gr (G) ∈ {1, 3}. We also present such a family, which has minimum possible order and size among all graphs with Grundy total domination number equal to k.

No abstract

Given a finite graph G, the maximum length of a sequence (v1,. .. , v k) of vertices in G such that each vi dominates a vertex that is not dominated by any vertex in {v1,. .. , vi−1} is called the Grundy domination number, γgr(G), of G. A small modification of the definition yields the Z-Grundy domination number, which is the dual invariant of the well-known zero forcing number. In this paper, we prove that γgr(G) ≥ n+⌈ k 2 ⌉−2 k−1 holds for every connected k-regular graph of order n different from K k+1 and 2C4. The bound in the case k = 3 reduces to γgr(G) ≥ n 2 , and we characterize the connected cubic graphs with γgr(G) = n 2. If G is different from K4 and K3,3, then n 2 is also an upper bound for the zero forcing number of a connected cubic graph, and we characterize the connected cubic graphs attaining this bound.