Efficient total domination in digraphs

DOI10.1016/J.JDA.2012.02.003zbMATH Open1247.05094OpenAlexW1965703804MaRDI QIDQ450576FDOQ450576

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

Recommendations

• On efficiently total dominatable digraphs
• scientific article; zbMATH DE number 4085682
• scientific article; zbMATH DE number 1151809
• 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
• scientific article; zbMATH DE number 6288906

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)

Cites Work

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

Cited In (20)

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

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)