Sharp bounds for product and sum throttling numbers
Combinatorics
2025-01-15 v2
Abstract
Throttling in graphs optimizes a sum or product of resources used, such as the number of vertices in an initial set, and time required, such as the propagation time, to complete a given task. We introduce a new technique to establish sharp upper bounds in terms of graph order for sum throttling and initial cost product throttling for power domination. Furthermore, we establish sharp bounds on possible changes of the product throttling number, both with and without initial cost, caused by certain graph operations for standard zero forcing, positive semidefinite forcing, and power domination.
Cite
@article{arxiv.2501.03472,
title = {Sharp bounds for product and sum throttling numbers},
author = {Ryan Blair and Gabriel Elvin and Veronika Furst and Leslie Hogben and Nandita Sahajpal and Tony W. H. Wong},
journal= {arXiv preprint arXiv:2501.03472},
year = {2025}
}