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.
Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-17679 |
Date | 28 June 2011 |
Creators | Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A. |
Publisher | Digital Commons @ East Tennessee State University |
Source Sets | East Tennessee State University |
Detected Language | English |
Type | text |
Source | ETSU Faculty Works |
Page generated in 0.0015 seconds