Journal of Algorithms
Efficient domination of the orientations of a graph
Discrete Mathematics
Graph classes: a survey
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
Information Processing Letters
The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
Computers & Mathematics with Applications
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
The twin domination number in generalized de Bruijn digraphs
Information Processing Letters
On the k-tuple domination of generalized de Brujin and Kautz digraphs
Information Sciences: an International Journal
On weighted efficient total domination
Journal of Discrete Algorithms
| Hi-index | 0.00 |
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.