Abstract
The power domination number, γP(G), is the minimum cardinality of a power dominating set. In this paper, we study the power domination number of some graph products. A general upper bound for γP(G H) is obtained. We determine some sharp upper bounds for γP(G H) and γP(G × H), where the graph H has a universal vertex. We characterize the graphs G and H of order at least four for which γP(G H) = 1. The generalized power domination number of the lexicographic product is also obtained.
Author supplied keywords
Cite
CITATION STYLE
Varghese, S., & Vijayakumar, A. (2016). On the power domination number of graph products. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9602, pp. 357–367). Springer Verlag. https://doi.org/10.1007/978-3-319-29221-2_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
