| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418583 | Discrete Applied Mathematics | 2011 | 5 Pages |
Abstract
A connected graph is total domination stable upon edge removal, if the removal of an arbitrary edge does not change the total domination number. We determine the minimum number of edges required for a total domination stable graph in terms of its order and total domination number.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning,