Positive Semidefinite Initial Cost Product Throttling

arXiv2207.02795MaRDI QIDQ6404191FDOQ6404191

Authors: Esther Conrad 

Publication date: 6 July 2022

Abstract: 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.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)

This page was built for publication: Positive Semidefinite Initial Cost Product Throttling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404191)