On the power domination number of the Cartesian product of graphs
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 Pn□Cmand the tori Cn□Cm. We also establish the power dominati...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860016301633 |
| 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 Pn□Cmand the tori Cn□Cm. We also establish the power domination number for Kn□K1,m, the Cartesian product of a complete graph and a star. Keywords: Electric power monitoring, Power domination, Zero forcing, Cartesian product |
|---|---|
| ISSN: | 0972-8600 |