Product Throttling

Sarah E. Anderson, Karen L. Collins, Daniela Ferrero, Leslie Hogben, Carolyn Mayer, Ann N. Trenk, Shanise Walker

英文摘要：

Throttling addresses the question of minimizing the sum or the product of the resources used to accomplish a task and the time needed to complete that task for various graph searching processes. Graph parameters of interest include various types of zero forcing, power domination, and Cops and Robbers. We provide a survey of product throttling for these parameters.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Product throttling for power domination

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 bo…

2020-12-03math.CO

Positive Semidefinite Initial Cost Product Throttling

Product throttling answers the question of minimizing the product of the resources needed to accomplish a task, and the time in which it takes to accomplish the task. In product throttling for positive semidefinite zero forcing, task that we wish to accomplish is positive semidefinite zero forcing. Positive semidefinite zero forcing is a game played on a graph $G$ that starts with a coloring of the vertices as white and blue. At each step any vertex colored blue with a unique white neighbor in a component of the graph formed by deleting the blue vertices from $G$ forces the color of the white …

2022-07-06math.CO

乘积与和节流数的精确界

Sharp bounds for product and sum throttling numbers

本研究提出新技术，为幂支配的和节流与初始成本乘积节流建立图阶数相关的精确上界，同时确定了三类图问题中特定图操作对乘积节流数变化影响的精确界。

2025-01-14math.CO

Generalizing forbidden induced subgraph characterizations of high throttling numbers

Zero forcing is a process that models the spread of information throughout a graph as white vertices are forced to turn blue using a color change rule. The idea of throttling, introduced in 2013 by Butler and Young, is to optimize the trade-off between the number of initial blue vertices and the time taken to force all vertices to become blue. The original throttling number of a graph minimizes the sum of these two quantities and the product throttling number minimizes their product. In addition, weighted throttling changes the weights given to these two quantities when minimizing their sum. S…

2022-04-07math.CO

Throttling问题的Sharp Nordhaus-Gaddum界

Sharp Nordhaus-Gaddum bounds for throttling

California State University Long Beach（加州州立大学长滩分校）；California State University, San Bernardino（加州州立大学圣贝纳迪诺分校）；Fort Lewis College（福特路易斯学院）；American Institute of Mathematics（美国数学研究所）；Iowa State University（爱荷华州立大学）；Purdue University（普渡大学）；Kutztown University of Pennsylvania（宾夕法尼亚库兹敦大学）

研究图论中throttling问题的Nordhaus-Gaddum界，给出标准零强制、半正定强制、功率支配和警察与强盗四种图操作下throttling数的紧的上下界。

2026-07-01math.CO

Throttling for Zero Forcing and Variants

Zero forcing is a process on a graph in which the goal is to force all vertices to become blue by applying a color change rule. Throttling minimizes the sum of the number of vertices that are initially blue and the number of time steps needed to color every vertex. We introduce a new universal definition of throttling for variants of zero forcing and the study of throttling for the minor monotone floor of zero forcing. We introduce the technique of using a zero forcing process to extend a given graph. For standard zero forcing and its floor, we use these extensions to characterize graphs with …

2019-03-13math.CO

更多相关论文收起更多论文

度量维数及其变体的节流（Throttling）研究

Throttling for metric dimension and its variants

该研究提出度量维数及其边、混合变体的节流方法，证明其节流数计算为NP-hard，给出特殊图族节流数公式与极值图特征，推导了n阶图与n阶树的最小节流数阶数界。

2025-10-01cs.DMmath.CO

Various Characterizations of Throttling Numbers

Zero forcing can be described as a combinatorial game on a graph that uses a color change rule in which vertices change white vertices to blue. The throttling number of a graph minimizes the sum of the number of vertices initially colored blue and the number of time steps required to color the entire graph. Positive semidefinite (PSD) zero forcing is a commonly studied variant of standard zero forcing that alters the color change rule. This paper introduces a method for extending a graph using a PSD zero forcing process. Using this extension method, graphs with PSD throttling number at most $t…

2021-02-22math.CO

Optimizing the trade-off between number of cops and capture time in Cops and Robbers

The cop throttling number $th_c(G)$ of a graph $G$ for the game of Cops and Robbers is the minimum of $k + capt_k(G)$, where $k$ is the number of cops and $capt_k(G)$ is the minimum number of rounds needed for $k$ cops to capture the robber on $G$ over all possible games in which both players play optimally. In this paper, we construct a family of graphs having $th_c(G)= Ω(n^{2/3})$, establish a sublinear upper bound on the cop throttling number, and show that the cop throttling number of chordal graphs is $O(\sqrt{n})$. We also introduce the product cop throttling number $th_c^{\times}(G)$ as…

2019-09-13cs.DMmath.CO

Embedding hypercubes into torus and Cartesian product of paths and cycles for minimizing wirelength

Though embedding problems have been considered for several regular graphs, it is still an open problem for hypercube into torus. In the paper, we prove the conjecture mathematically and obtain the minimum wirelength of embedding for hypercube into Cartesian product of paths and/or cycles. In addition, we explain that Gray code embedding is an optimal strategy in such embedding problems.

2023-02-26cs.DMmath.CO