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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
