Generalized power domination in claw-free regular graphs
DOI10.1007/s00373-022-02476-0zbMath1485.05133arXiv1905.11655OpenAlexW3094266530MaRDI QIDQ2117535
Hangdi Chen, Qingjie Ye, Chang-hong Lu
Publication date: 21 March 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.11655
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Applications of graph theory (05C90) 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)
Cites Work
- Unnamed Item
- Generalized power domination of graphs
- On the power domination number of the generalized Petersen graphs
- Power domination in regular claw-free graphs
- Parameterized power domination complexity
- On the \({k}\)-power domination of hypergraphs
- Improved algorithms and complexity results for power domination in graphs
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- Nordhaus-Gaddum problems for power domination
- The relationship between \(k\)-forcing and \(k\)-power domination
- Disproofs of three conjectures on the power domination of graphs
- Generalized power domination: propagation radius and Sierpiński graphs
- Infectious power domination of hypergraphs
- The \(k\)-power domination problem in weighted trees
- Restricted power domination and zero forcing problems
- A note on power domination in grid graphs
- Power domination in 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
- \(k\)-power domination in block graphs
This page was built for publication: Generalized power domination in claw-free regular graphs
