Efficient total domination in digraphs
Efficient total domination in digraphs.
Technical Report , 15 p.
We generalize the concept of efficient total domination from graphs to digraphs. An efficiently total dominating set X of a digraph D is a vertex subset such that every vertex of D has exactly one predecessor in X . Not every digraph has an efficiently total dominating set. We study graphs that permit an orientation having such a set and give complexity results and characterizations concerning this question. Furthermore, we study the computational complexity of the (weighted) efficient total domination problem for several digraph classes. In particular we deal with most of the common generalizations of tournaments, like locally semicomplete and arc-locally semicomplete digraphs.
|Item Type:||Paper (Technical Report)|
|Citations:||0 (Google Scholar) ||
|Uncontrolled Keywords:||total domination efficient total domination digraphs domination in digraphs|
|Divisions:||Institute of Computer Science > Computer Science Department - Prof. Dr. Schrader
Mathematical Institute > Prof. Dr. Faigle
|Depositing User:||Oliver Schaudt|
|Date Deposited:||11 Jan 2011 00:00|
|Last Modified:||19 Dec 2011 09:46|