Abstract
Let S be a set of vertices of a graph G. Let be the set of vertices built from the closed neighborhood of S, by iteratively applying the following propagation rule: if a vertex and all but exactly one of its neighbors are in then the remaining neighbor is also in A set S is called a power dominating set of G if The power domination number of G is the minimum cardinality of a power dominating set. In this paper, we present some necessary conditions for two graphs G and H to satisfy for product graphs.
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.
