Title of article
Vertices contained in all or in no minimum total dominating set of a tree Original Research Article
Author/Authors
Ernest J. Cockayne، نويسنده , , Michael A. Henning، نويسنده , , Christina M. Mynhardt، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
8
From page
37
To page
44
Abstract
A 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.
Keywords
Total domination , Tree , Total domination number
Journal title
Discrete Mathematics
Serial Year
2003
Journal title
Discrete Mathematics
Record number
949432
Link To Document