Total domination in block graphs
From MaRDI portal
Publication:1124531
DOI10.1016/0167-6377(89)90034-5zbMath0678.90086OpenAlexW2060286450MaRDI QIDQ1124531
Publication date: 1989
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(89)90034-5
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Labeling algorithms for domination problems in sun-free chordal graphs, A linear-time algorithm for weighted paired-domination on block graphs, On the algorithmic complexity of \(k\)-tuple total domination, Convexity of minimal total dominating functions in graphs, On the computational complexity of upper total domination, The bottleneck independent domination on the classes of bipartite graphs and block graphs., Hardness results and approximation algorithm for total liar's domination in graphs, Power domination in block graphs, \(k\)-power domination in block graphs, Bibliography on domination in graphs and some basic definitions of domination parameters, Roman \(\{2\}\)-domination problem in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domination, independent domination, and duality in strongly chordal graphs
- R-domination of block graphs
- A linear algorithm for the domination number of a tree
- A linear algorithm for the domination number of a series-parallel graph
- On the computational power of pushdown automata
- Covering, Packing and Generalized Perfection
- On the Algorithmic Complexity of Total Domination
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Domination in permutation graphs
- Dominating Sets in Chordal Graphs
- R -Domination in Graphs
- The NP-completeness column: An ongoing guide
- Total domination in interval graphs
