Trees with large total domination number
Abstract
It is well-known that the total domination number γt(G) of a graph G without isolated vertices is at most twice its domination number γ(G). We provide a constructive characterization of trees T satisfying γt(T) = 2γ(T).











