An extremal problem for total domination stable graphs upon edge removal
- Desormeaux, Wyatt J.
- Haynes, Teresa W.
- Henning, Michael A.
Publication date
June 2011
DOI Publisher
Elsevier B.V. ISSN
0166-218X Citation count (estimate)
13Abstract
AbstractA 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
Add to ORKG