The total domination number t of a graph G = (V; E) is the minimum cardinality of a dominating set D of G such that every vertex of V has at least one neighbor in D. The least domination number L of G is the minimum cardinality of a dominating set X of G whose domination number is the minimum. In this paper, we prove the following conjecture due to Odile… (More)