Return to search

Total Domination Changing and Stable Graphs Upon Vertex Removal

A set S of vertices in a graph G is a total dominating set if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number of G. A graph is total domination vertex removal stable if the removal of an arbitrary vertex leaves the total domination number unchanged. On the other hand, a graph is total domination vertex removal changing if the removal of an arbitrary vertex changes the total domination number. In this paper, we study total domination vertex removal changing and stable graphs.

Identiferoai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-17677
Date06 September 2011
CreatorsDesormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.
PublisherDigital Commons @ East Tennessee State University
Source SetsEast Tennessee State University
Detected LanguageEnglish
Typetext
SourceETSU Faculty Works

Page generated in 0.0022 seconds