Product throttling for power domination
Combinatorics
2020-12-07 v2
Abstract
The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number. It is established that the two parameters are equal for certain families including paths, cycles, complete graphs, unit interval graphs, and grid graphs (on the plane, cylinder, and torus). Families of graphs for which the product power throttling number is less than the domination number are also exhibited. Graphs with extremely high or low product power throttling number are characterized and bounds on the product power throttling number are established.
Cite
@article{arxiv.2010.16315,
title = {Product throttling for power domination},
author = {Sarah E. Anderson and Karen L. Collins and Daniela Ferrero and Leslie Hogben and Carolyn Mayer and Ann N. Trenk and Shanise Walker},
journal= {arXiv preprint arXiv:2010.16315},
year = {2020}
}
Comments
Corrected typographical error in Remark 4.2