Total Domination Critical and Stable Graphs Upon Edge Removal
Document Type
Article
Publication Date
8-6-2010
Description
A set S of vertices in a graph G is a total dominating set of G 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 edge critical if the removal of any arbitrary edge increases the total domination number. On the other hand, a graph is total domination edge stable if the removal of any arbitrary edge has no effect on the total domination number. In this paper, we characterize total domination edge critical graphs. We also investigate various properties of total domination edge stable graphs.
Citation Information
Desormeaux, Wyatt J.; Haynes, Teresa W.; and Henning, Michael A.. 2010. Total Domination Critical and Stable Graphs Upon Edge Removal. Discrete Applied Mathematics. Vol.158(15). 1587-1592. https://doi.org/10.1016/j.dam.2010.06.003 ISSN: 0166-218X