Recent Results on the Power Domination Numbers of Graph Products

Authors

  • K. W. Soh The University of Auckland
  • K. M. Koh Singapore University of Technology and Design

Keywords:

Electric power monitoring, Power domination, Graph products

Abstract

We review recent results on the power domination problem of graph products and establish improved results for some families of graph products, namely, C_{n} \times C_{m}, P_{n} \times C_{m}, PnPm, PnCm and CnCm. We also characterize graphs G and H for which the power domination number of the Cartesian product of G and H, which is denoted as \gamma_{p}(G \;\Box\;H), is 1.

 

Downloads

Download data is not yet available.

Author Biographies

K. W. Soh, The University of Auckland

Department of Engineering Science,

The University of Auckland,

70 Symonds Street,

Auckland 1010

K. M. Koh, Singapore University of Technology and Design

Engineering Systems and Design,

Singapore University of Technology and Design,

8 Somapah Road,

Singapore 487372

 

Downloads

Published

2018-12-31

How to Cite

Soh, K. W. ., & Koh, K. M. . (2018). Recent Results on the Power Domination Numbers of Graph Products. New Zealand Journal of Mathematics, 48, 41–53. Retrieved from https://nzjmath.org/index.php/NZJMATH/article/view/36

Issue

Section

Articles