Efficient total domination in digraphs

DOI10.1016/J.JDA.2012.02.003MaRDI QIDQ450576zbMATHOpenAlexFDO

Authors 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

digraphstotal dominationtournamentslocally semicomplete digraphsefficient total dominationarc-locally semicomplete digraphsdomination in digraphs

Mathematics Subject Classification ID

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

Recommendations

• On efficiently total dominatable digraphs
• Publication:3815323
• Publication:4387716
• Generalized domination and efficient domination in graphs
• Efficient domination in circulant graphs
• Efficient total dominating sets in Cayley graphs
• Efficient open domination in digraphs
• Efficient edge domination problems in graphs
• Efficient domination in Mycielski's graphs
• Publication:5412365

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 2104726 (Why is no real title available?)
• Depth-First Search and Linear Graph Algorithms
• Efficient domination of the orientations of a graph
• Graph Classes: A Survey
• On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs
• On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
• On the existence of total dominating subgraphs with a prescribed additive hereditary property
• On weighted efficient total domination
• Planar 3DM is NP-complete
• The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
• The structure of strong arc-locally in-semicomplete digraphs
• The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
• The twin domination number in generalized de Bruijn digraphs

Cited in

(20)

• On efficiently total dominatable digraphs
• Graph orientation and its total efficient domination
• Worst-case efficient dominating sets in digraphs
• Existence of efficient total dominating sets of circulant graphs of degree 4
• Efficient closed domination in digraph products
• An algorithmic characterization of total digraphs
• On weighted efficient total domination
• Classes of intersection digraphs with good algorithmic properties
• Efficient edge domination in regular graphs
• scientific article; zbMATH DE number 5914896 (Why is no real title available?)
• Packing and domination parameters in digraphs
• The total bondage numbers and efficient total dominations of vertex-transitive graphs
• A Taxonomy of Perfect Domination
• Efficient open domination in digraphs
• k-Efficient domination: Algorithmic perspective
• Efficient domination through eigenvalues
• Domination in digraphs
• Efficient domination in cubic vertex-transitive graphs
• Efficient domination in knights graphs
• scientific article; zbMATH DE number 5080622 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450576)