On the $$\varvec{k}$$ k -power domination of hypergraphs

Gerard Jennhwa Chang () and Nicolas Roussel ()
Additional contact information
Gerard Jennhwa Chang: National Taiwan University
Nicolas Roussel: National Taiwan University

Journal of Combinatorial Optimization, 2015, vol. 30, issue 4, No 18, 1095-1106

Abstract: Abstract The study of electric power networks led to the definition and study of power domination in graphs. This notion was later extended to k-power domination. In the current paper we start the study of the k-power domination in hypergraphs. In particular, we give a structural characterization of the k-power domination number for hypertrees. We also establish a linear-time algorithm to solve the k-power domination problem in hypertrees. Finally, lower and upper bounds for the k-power domination number of standard and non standard connected (r-uniform) hypergraphs are obtained.

Keywords: Power domination; k-Power domination; Hypertree; Hypergraph; Uniform hypergraph (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9688-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:30:y:2015:i:4:d:10.1007_s10878-013-9688-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9688-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().