Abstract
The power domination problem in graphs was introduced to model the monitoring problem in electric networks. It is to find a set of vertices, S ⊆ V ( G ) , of a graph G, called the power dominating set, that monitors V(G) by application of two rules, namely, domination and propagation. In this article, we discuss the power domination problem in the Mycielskians of n-spiders. We show that the power domination number of the Mycielskians of n-spiders is bounded above by n and also characterize the Mycielskians of n-spiders with γ P = 1 and γ P = n .
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 callMore From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: 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.
