Total Domination Changing and Stable Graphs Upon Vertex Removal
Document Type
Article
Publication Date
9-6-2011
Description
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.
Citation Information
Desormeaux, Wyatt J.; Haynes, Teresa W.; and Henning, Michael A.. 2011. Total Domination Changing and Stable Graphs Upon Vertex Removal. Discrete Applied Mathematics. Vol.159(15). 1548-1554. https://doi.org/10.1016/j.dam.2011.06.006 ISSN: 0166-218X