Total dominating sequences in trees, split graphs, and under modular decomposition

Abstract

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.

Grundy dominating sequences and zero forcing sets

“…Note that Proposition 3.1(ii) implies that Z(G) ≥ |V (G)| − γ t gr (G) for any graph G with no isolated vertices. By [7,Proposition 3.2], γ t gr (G) ≤ 2β(G), which in turn implies that Z(G) ≥ |V (G)| − 2β(G). Finally, by the well-known formula α(G) = |V (G)| − β(G), we conclude that Z(G) ≥ α(G) − β(G).…”

On Grundy total domination number in product graphs

“…By Theorem 2.7, it suffices to show that γ t gr (T ) = 2bc(T ). By the result in [9], γ t gr (T ) = 2β(T ), where β(T ) is the vertex cover number of T . Since the vertex cover can be interpreted as covering edges with stars, and stars are the only complete bipartite graphs in trees, it holds β(T ) = bc(T ).…”

Grundy Domination Sequences in Generalized Corona Products of Graphs

“…Based on the domination number and the total domination number, various Grundy domination invariants have been introduced in recent years by some authors [1,5,6] and then they continued the study of these concepts in [3,2,4,7].…”