\(k\)-power domination in block graphs
From MaRDI portal
Publication:5963656
DOI10.1007/s10878-014-9795-0zbMath1331.05174OpenAlexW2002203880WikidataQ60630534 ScholiaQ60630534MaRDI QIDQ5963656
Lei Chen, Chang-hong Lu, Chao Wang
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
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (9)
Labeling algorithm for power domination problem of trees ⋮ Restricted power domination and zero forcing problems ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ On computing a minimum secure dominating set in block graphs ⋮ On 2-rainbow domination of generalized Petersen graphs ⋮ Algorithms and Complexity of Power Domination in Graphs ⋮ Disproofs of three conjectures on the power domination of graphs ⋮ Power domination in regular claw-free graphs ⋮ Generalized power domination in claw-free regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized power domination of graphs
- On the power domination number of the generalized Petersen graphs
- On rigid circuit graphs
- 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
- 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
- R-domination of block graphs
- A linear algorithm for the domination number of a tree
- The bottleneck independent domination on the classes of bipartite graphs and block graphs.
- Power domination in circular-arc graphs
- A note on power domination in grid graphs
- Power domination in block graphs
- Generalized Power Domination in Regular Graphs
- Power Domination in Product Graphs
- Domination in Graphs Applied to Electric Power Networks
- Computing and Combinatorics
- Approximation Algorithms and Hardness for Domination with Propagation
This page was built for publication: \(k\)-power domination in block graphs