Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4650197 | Discrete Mathematics | 2009 | 32 Pages |
Abstract
A set SS of vertices in a graph GG is a total dominating set of GG if every vertex of GG is adjacent to some vertex in SS. In this paper, we offer a survey of selected recent results on total domination in graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Michael A. Henning,