k-power domination in block graphs
DOI10.1007/S10878-014-9795-0zbMATH Open1331.05174OpenAlexW2002203880WikidataQ60630534 ScholiaQ60630534MaRDI QIDQ5963656FDOQ5963656
Chao Wang, Changhong Lu, Lei Chen
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-9795-0
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) 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?)
- On rigid circuit graphs
- A linear algorithm for the domination number of a tree
- Title not available (Why is that?)
- Generalized power domination of graphs
- Domination in Graphs Applied to Electric Power Networks
- Approximation Algorithms and Hardness for Domination with Propagation
- Parameterized power domination complexity
- Improved algorithms and complexity results for power domination in graphs
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- A note on power domination in grid graphs
- Power Domination in Product Graphs
- Labelling algorithms for paired-domination problems in block and interval graphs
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- Total domination in block graphs
- On the power domination number of the generalized Petersen graphs
- Power domination in block graphs
- Computing and Combinatorics
- Title not available (Why is that?)
- Power domination in circular-arc graphs
- The bottleneck independent domination on the classes of bipartite graphs and block graphs.
- Generalized power domination in regular graphs
- R-domination of block graphs
Cited In (12)
- Title not available (Why is that?)
- Generalized power domination in claw-free regular graphs
- On computing a minimum secure dominating set in block graphs
- 2-power domination number for Knödel graphs and its application in communication networks
- Algorithms and Complexity of Power Domination in Graphs
- The \(k\)-power domination problem in weighted trees
- Power domination in regular claw-free graphs
- Restricted power domination and zero forcing problems
- Labeling algorithm for power domination problem of trees
- Power domination in block graphs
- Disproofs of three conjectures on the power domination of graphs
- On 2-rainbow domination of generalized Petersen graphs
This page was built for publication: \(k\)-power domination in block graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963656)
