On the power domination number of the Cartesian product of graphs

On the power domination number of the Cartesian product of graphs

Show other versions (1)

We give a brief survey about the existing results on the power domination of the Cartesian product of graphs, and improve two of the results by determining the exact power domination numbers of two families of graphs, namely, the cylinder and the tori . We also establish the power domination number...

Full description

Bibliographic Details
Main Authors: K.M. Koh, K.W. Soh
Format: Article
Language:English
Published: Taylor & Francis Group 2019-12-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
electric power monitoring
power domination
zero forcing
cartesian product
Online Access:http://dx.doi.org/10.1016/j.akcej.2019.02.004
Description
Summary:We give a brief survey about the existing results on the power domination of the Cartesian product of graphs, and improve two of the results by determining the exact power domination numbers of two families of graphs, namely, the cylinder and the tori . We also establish the power domination number for , the Cartesian product of a complete graph and a star.
ISSN:0972-8600

Similar Items