Schaudt, Oliver
(2011).
When the connected domination number is at most the total domination number.
Working Paper.
|
PDF
zaik2011-621.pdf Download (92kB) | Preview |
Abstract
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: | Preprints, Working Papers or Reports (Working Paper) | ||||||||
| Creators: |
|
||||||||
| URN: | urn:nbn:de:hbz:38-550121 | ||||||||
| Date: | May 2011 | ||||||||
| Language: | English | ||||||||
| Faculty: | Faculty of Mathematics and Natural Sciences | ||||||||
| Divisions: | Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science | ||||||||
| Subjects: | Data processing Computer science | ||||||||
| Refereed: | No | ||||||||
| URI: | http://kups.ub.uni-koeln.de/id/eprint/55012 |
Downloads
Downloads per month over past year
Export
Actions (login required)
 |
View Item |