Product throttling

DOI10.1007/978-3-030-77983-2_2MaRDI QIDQ2073191zbMATH OpenOpenAlexFDO

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

Publication date 1 February 2022

Full work available at URL https://arxiv.org/abs/2012.12807

zbMATH Keywords

power dominationCops and Robbersgraph searching processpositive semidefinite zero forcingstandard zero forcing

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

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

Recommendations

• scientific article; zbMATH DE number 7666852
• Skew throttling
• Dealing with the product constraint
• Throttling for zero forcing and variants
• Power domination throttling
• scientific article; zbMATH DE number 6375120
• Cutoffs for product chains
• Volume product
• Publication:3483036

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• A game of cops and robbers
• A note on \(k\)-cop, \(l\)-robber games on graphs
• Computing the domination number of grid graphs
• Connectivity measures in matched sum graphs
• Domination in Graphs Applied to Electric Power Networks
• Fast-mixed searching and related problems on graphs
• Graphs with Given Group and Given Graph-Theoretical Properties
• Independent domination in hypercubes
• Inverse Problems and Zero Forcing for Graphs
• More agents may decrease global work: a case in butterfly decontamination
• Note on power propagation time and lower bounds for the power domination number
• On generalized Petersen graphs labeled with a condition at distance two
• Positive semidefinite propagation time
• Propagation time for zero forcing on a graph
• The PMU Placement Problem
• The capture time of a graph
• The domination number of grids
• The game of overprescribed Cops and Robbers played on graphs
• Throttling for the game of cops and robbers on graphs
• Throttling for zero forcing and variants
• Throttling positive semidefinite zero forcing propagation time on graphs
• Throttling zero forcing propagation speed on graphs
• Various characterizations of throttling numbers
• Zero forcing sets and the minimum rank of graphs
• \((G_1, G_2)\)-permutation graphs

Cited in

(4)

• scientific article; zbMATH DE number 7666852 (Why is no real title available?)
• Throttling processes equivalent to full throttling on trees
• Product throttling for power domination
• scientific article; zbMATH DE number 7731182 (Why is no real title available?)

This page was built for publication: Product throttling

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