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