On efficiently total dominatable digraphs

DOI10.1007/s40840-016-0424-1zbMath1404.05159OpenAlexW2525367323MaRDI QIDQ1714019

Fu-Tao Hu, Moo Young Sohn, Xue-gang Chen

Publication date: 31 January 2019

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-016-0424-1

zbMATH Keywords

digraphsblock graphNP-complete problemefficient total domination

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Efficient closed domination in digraph products

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On weighted efficient total domination
• Efficient total domination in digraphs
• Efficient domination in circulant graphs with two chord lengths
• Perfect codes over graphs
• Efficient domination of the orientations of a graph
• Efficient dominating sets in Cayley graphs.
• The weighted perfect domination problem and its variants
• Worst-case efficient dominating sets in digraphs
• The bondage numbers and efficient dominations of vertex-transitive graphs
• Efficient dominating sets in labeled rooted oriented trees
• Perfect Codes for Metrics Induced by Circulant Graphs

This page was built for publication: On efficiently total dominatable digraphs