Abstract
The power domination problem in the graph was introduced to model the monitoring problem in electric networks. It is to find a set of vertices with minimum cardinality, called a power dominating set (PDS), that monitors the whole set $ V $ after applying the rules, domination and propagation. In this paper, we discuss the power domination problem in generalized Mycielskian of spiders. We characterize spiders with $\gamma _P(\mu _m(T))= 1$. If $\gamma _P(\mu _m(T))\neq 1 $ and $ m $ is even then $ \gamma _P(\mu _m(T))=\frac {m}{2} +1$. We also show that if $ m $ is odd and $ \gamma _P(\mu _m(T))\neq 1 $, then $ \lceil \frac {m+1}{2}\rceil \leq \gamma _P(\mu _m(T))\leq \lceil \frac {m}{2}\rceil +1$.
Published Version
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.
