On the \({k}\)-power domination of hypergraphs
From MaRDI portal
Publication:887853
DOI10.1007/s10878-013-9688-7zbMath1326.90093OpenAlexW2466925173MaRDI QIDQ887853
Nicolas Roussel, Gerard Jennhwa Chang
Publication date: 3 November 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9688-7
Related Items (8)
An upper bound for the \(k\)-power domination number in \(r\)-uniform hypergraphs ⋮ Zero forcing and maximum nullity for hypergraphs ⋮ Restricted power domination and zero forcing problems ⋮ Connected power domination in graphs ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ Infectious power domination of hypergraphs ⋮ Algorithms and Complexity of Power Domination in Graphs ⋮ Generalized power domination in claw-free regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized power domination of graphs
- Improved algorithms and complexity results for power domination in graphs
- Equality of domination and transversal numbers in hypergraphs
- Domination in hypergraphs
- Power domination in graphs
- Hypergraph domination and strong independence
- Domination in Graphs Applied to Electric Power Networks
- Computing and Combinatorics
This page was built for publication: On the \({k}\)-power domination of hypergraphs
