Efficient total domination in digraphs
From MaRDI portal
Publication:450576
DOI10.1016/j.jda.2012.02.003zbMath1247.05094MaRDI QIDQ450576
Publication date: 13 September 2012
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.02.003
digraphs; tournaments; total domination; locally semicomplete digraphs; efficient total domination; arc-locally semicomplete digraphs; domination in digraphs
68Q25: Analysis of algorithms and problem complexity
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C20: Directed graphs (digraphs), tournaments
Related Items
A Taxonomy of Perfect Domination, On efficiently total dominatable digraphs, Packing and domination parameters in digraphs, The total bondage numbers and efficient total dominations of vertex-transitive graphs, Efficient closed domination in digraph products, Domination in Digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On weighted efficient total domination
- On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs
- On the existence of total dominating subgraphs with a prescribed additive hereditary property
- The twin domination number in generalized de Bruijn digraphs
- The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
- On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
- The structure of strong arc-locally in-semicomplete digraphs
- Efficient domination of the orientations of a graph
- The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
- Planar 3DM is NP-complete
- Graph Classes: A Survey
- Depth-First Search and Linear Graph Algorithms