| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648966 | Discrete Mathematics | 2010 | 9 Pages |
Abstract
A set SS of vertices in a graph GG is a total dominating set if every vertex of GG is adjacent to some vertex in SS. The minimum cardinality of a total dominating set of GG is the total domination number of GG. A graph is total domination edge addition stable if the addition of an arbitrary edge has no effect on the total domination number. In this paper, we characterize total domination edge addition stable graphs. We determine a sharp upper bound on the total domination number of total domination edge addition stable graphs, and we determine which combinations of order and total domination number are attainable. We finish this work with an investigation of claw-free total domination edge addition stable graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning,