6 research outputs found
Vertices contained in all or in no minimum total dominating set of a tree
Get PDFAbstractA set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. We characterize the set of vertices of a tree that are contained in all, or in no, minimum total dominating sets of the tree
An interpolation theorem for partitions which are complete with respect to hereditary properties
No full text
