An efficient algorithm for distance total domination in block graphs
From MaRDI portal
Publication:5963627
DOI10.1007/S10878-014-9758-5zbMATH Open1331.05213OpenAlexW1995758257MaRDI QIDQ5963627FDOQ5963627
Authors: Yancai Zhao, Erfang Shan
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- On the Algorithmic Complexity of Total Domination
- A survey of selected recent results on total domination in graphs
- Total domination and transformation
- A linear algorithm for finding a minimum dominating set in a cactus
- A linear algorithm for the domination number of a tree
- Edge domination in graphs
- On the mixed domination problem in graphs
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Title not available (Why is that?)
- The algorithmic complexity of mixed domination in graphs
- Rainbow domination on trees
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Labelling algorithms for paired-domination problems in block and interval graphs
- Algorithmic aspects of \(k\)-tuple total domination in graphs
- Labeling algorithms for domination problems in sun-free chordal graphs
- Complexity of certain functional variants of total domination in chordal bipartite graphs
- Title not available (Why is that?)
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
- R -Domination in Graphs
- The diversity of domination
- Domination in distance-hereditary graphs
- An algorithm to find two distance domination parameters in a graph
Cited In (4)
This page was built for publication: An efficient algorithm for distance total domination in block graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963627)