Locating and total dominating sets in trees

A set S   of vertices in a graph G=(V,E)G=(V,E) is a total dominating set of G   if every vertex of VV is adjacent to a vertex in S  . We consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of VV are totally dominated by distinct subsets of the total dominating set.