On the \({k}\)-power domination of hypergraphs
type: Item
instance of: scholarly article
title: On the \({k}\)-power domination of hypergraphs
zbMATH Open document ID: 1326.90093
author: Nicolas Roussel
author: Gerard Jennhwa Chang
published in: Journal of Combinatorial Optimization
publication date: 2015-11-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6503869
zbMATH Keywords: power domination
zbMATH Keywords: \(k\)-power domination
zbMATH Keywords: hypertree
zbMATH Keywords: hypergraph
zbMATH Keywords: uniform hypergraph
MaRDI profile type: Publication
full work available at URL: s10878-013-9688-7
OpenAlex ID: W2466925173
cites work: Domination in hypergraphs
cites work: Q3012384
cites work: Equality of domination and transversal numbers in hypergraphs
cites work: Q3277097
cites work: Q4247463
cites work: Generalized power domination of graphs
cites work: Improved algorithms and complexity results for power domination in graphs
cites work: Q4368729
cites work: Q4368728
cites work: Domination in Graphs Applied to Electric Power Networks
cites work: Hypergraph domination and strong independence
cites work: Computing and Combinatorics
cites work: Power domination in graphs
DOI: 10.1007/S10878-013-9688-7
description: scientific article; zbMATH DE number 6503869