Product throttling

DOI10.1007/978-3-030-77983-2_2zbMATH Open1482.05248arXiv2012.12807OpenAlexW4232783501MaRDI QIDQ2073191FDOQ2073191

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

Publication date: 1 February 2022

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.

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

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

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)

Cites Work

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

Cited In (4)

• Product throttling for power domination
• Title not available (Why is that?)
• Throttling processes equivalent to full throttling on trees
• Title not available (Why is that?)

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)