An efficient algorithm for distance total domination in block graphs

DOI10.1007/s10878-014-9758-5zbMath1331.05213OpenAlexW1995758257MaRDI QIDQ5963627

Erfang Shan, Yan-Cai Zhao

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9758-5

zbMATH Keywords

graph algorithmblock graphtotal domination\(k\)-distance total domination

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Total domination and transformation
• Algorithmic aspects of \(k\)-tuple total domination in graphs
• The algorithmic complexity of mixed domination in graphs
• Rainbow domination on trees
• Labelling algorithms for paired-domination problems in block and interval graphs
• A survey of selected recent results on total domination in graphs
• A linear algorithm for finding a minimum dominating set in a cactus
• Labeling algorithms for domination problems in sun-free chordal graphs
• A linear algorithm for the domination number of a tree
• The diversity of domination
• Edge domination in graphs
• An algorithm to find two distance domination parameters in a graph
• The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
• On the mixed domination problem in graphs
• COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS
• On the Algorithmic Complexity of Total Domination
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• R -Domination in Graphs
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
• Domination in distance-hereditary graphs

This page was built for publication: An efficient algorithm for distance total domination in block graphs