When the connected domination number is at most the total domination number
When the connected domination number is at most the total domination number.
Technical Report , 6 p.
In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number. This question is motivated by the fact that any connected dominating set of size at least 2 is in particular a total dominating set. It turns out that in this characterization, the total domination number can equivalently be substituted by the upper total domination number, the paired-domination number and the upper paired-domination number respectively. Another equivalent condition is given in terms of structural domination.
|Item Type:||Paper (Technical Report)|
|Citations:||0 (Google Scholar) ||
|Uncontrolled Keywords:||connected domination total domination paired-domination perfection of parameters|
|Divisions:||Institute of Computer Science > Computer Science Department - Prof. Dr. Schrader
Mathematical Institute > Prof. Dr. Faigle
|Depositing User:||Oliver Schaudt|
|Date Deposited:||17 May 2011 00:00|
|Last Modified:||19 Dec 2011 09:44|