New Bounds on the Double Total Domination Number of Graphs.

Let G be a graph of minimum degree at least two. A set D ⊆ V (G) is said to be a double total dominating set of G if | N (v) ∩ D | ≥ 2 for every vertex v ∈ V (G) . The minimum cardinality among all double total dominating sets of G is the double total domination number of G. In this article, we continue with the study of this parameter. In particular, we provide new bounds on the double total domination number in terms of other domination parameters. Some of our results are tight bounds that improve some well-known results. [ABSTRACT FROM AUTHOR]