A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, the total domination number of G - v is less than the total domination number of G. These graphs we call γt-critical. If such a graph G has total domination number k, we call it k-γt-critical. We characterize the connected graphs with minimum degree one that are γ t-critical and we obtain sharp bounds on their maximum diameter. We calculate the maximum diameter of a k-γt-critical graph for k≤8 and provide an example which shows that the maximum diameter is in general at least 5k/3 - O(1).
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-19921 |
| Date | 28 September 2004 |
| Creators | Goddard, Wayne, Haynes, Teresa W., Henning, Michael A., Van der Merwe, Lucas C. |
| 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.0019 seconds