Efficient total domination in digraphs |
| |
Institution: | Institut für Informatik, Arbeitsgruppe Faigle/Schrader, Universität zu Köln, Weyertal 80, 50931 Cologne, Germany |
| |
Abstract: | 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. We study graphs that permit an orientation having such a set and give complexity results and characterizations. 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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|