论文标题
阳性半决赛初始成本产品节流
Positive Semidefinite Initial Cost Product Throttling
论文作者
论文摘要
产品节流回答了将完成任务的资源的产品以及完成任务所需的时间的最小化问题的问题。在阳性半决赛零强迫的产品限制中，我们希望完成的任务是阳性的半芬矿强迫。积极的半决赛零强迫是在图$ g $上玩的游戏，从白色和蓝色的顶点着色开始。在每个步骤中，通过删除蓝色顶点从$ g $中删除蓝色顶点的组成部分中的任何顶点蓝色蓝色，都会迫使白色邻居的颜色变成蓝色。我们在初始成本产品节流数字上给出了各种结果和界限，包括$ 1+rad（g）$的下限和一个循环的初始成本产品节流数。我们还提供了一张表面的表，其中包括初始成本，没有针对各种图形系列的初始成本产品节流数字。
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 neighbor to become blue. We give various results and bounds on the initial cost product throttling number, including a lower bound of $1+rad(G)$ and the initial cost product throttling number of a cycle. We also include a table with results on the initial cost and no initial cost product throttling number for various graph families.
