In this paper we consider the effect of edge contraction on the domination number and total domination number of a graph. We define the (total) domination contraction number of a graph as the minimum number of edges that must be contracted in order to decrease the (total) domination number. We show both of this two numbers are at most three for any graph. In view of this result, we classify graphs by their (total) domination contraction numbers and characterize these classes of graphs.
|Original language||English (US)|
|Number of pages||13|
|State||Published - Jan 2010|
- Domination contraction number
- Total domination
ASJC Scopus subject areas