Efficient total domination in digraphs

DOI10.1016/j.jda.2012.02.003zbMath1247.05094OpenAlexW1965703804MaRDI QIDQ450576

Oliver Schaudt

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

zbMATH Keywords

digraphstournamentstotal dominationlocally semicomplete digraphsefficient total dominationarc-locally semicomplete digraphsdomination in digraphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

A Taxonomy of Perfect Domination ⋮ Efficient closed domination in digraph products ⋮ Classes of intersection digraphs with good algorithmic properties ⋮ On efficiently total dominatable digraphs ⋮ Domination in Digraphs ⋮ Packing and domination parameters in digraphs ⋮ The total bondage numbers and efficient total dominations of vertex-transitive graphs

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

This page was built for publication: Efficient total domination in digraphs