The k-power domination problem in weighted trees
DOI10.1016/J.TCS.2019.12.013zbMATH Open1436.05107OpenAlexW2994757990MaRDI QIDQ2290632FDOQ2290632
Authors: Changjie Cheng, Yu Zhou, Changhong Lu 
Publication date: 29 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.12.013
Recommendations
Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)
Cites Work
- On domination problems for permutation and other graphs
- Title not available (Why is that?)
- Generalized power domination of graphs
- Domination in Graphs Applied to Electric Power Networks
- The weighted perfect domination problem
- Weighted independent perfect domination on cocomparability graphs
- Approximation Algorithms and Hardness for Domination with Propagation
- 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
- A unified approach to domination problems on interval graphs
- Computing and Combinatorics
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
- Title not available (Why is that?)
- Optimum domination in weighted trees
- Title not available (Why is that?)
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- WEIGHTED DOMINATION NUMBER OF CACTUS GRAPHS
Cited In (12)
- Minimum weight clustered dominating tree problem
- A dynamic domination problem in trees
- Generalized power domination in claw-free regular graphs
- Title not available (Why is that?)
- 2-power domination number for Knödel graphs and its application in communication networks
- On the \({k}\)-power domination of hypergraphs
- Parameterized power domination complexity
- The \(k\)-power domination problem in weighted trees
- \(k\)-power domination in block graphs
- The restrained double Roman domination in graphs
- Labeling algorithm for power domination problem of trees
- The weighted perfect domination problem and its variants
This page was built for publication: The \(k\)-power domination problem in weighted trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290632)
