Product throttling
From MaRDI portal
Publication:2073191
DOI10.1007/978-3-030-77983-2_2zbMath1482.05248arXiv2012.12807OpenAlexW4232783501MaRDI QIDQ2073191
Ann N. Trenk, Carolyn Mayer, Leslie Hogben, Shanise Walker, Karen L. Collins, Daniela Ferrero, Sarah E. Anderson
Publication date: 1 February 2022
Full work available at URL: https://arxiv.org/abs/2012.12807
power dominationCops and Robbersgraph searching processpositive semidefinite zero forcingstandard zero forcing
Games involving graphs (91A43) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- More agents may decrease global work: a case in butterfly decontamination
- Fast-mixed searching and related problems on graphs
- Propagation time for zero forcing on a graph
- Computing the domination number of grid graphs
- Throttling for the game of cops and robbers on graphs
- A game of cops and robbers
- Positive semidefinite propagation time
- Connectivity measures in matched sum graphs
- The capture time of a graph
- Note on power propagation time and lower bounds for the power domination number
- Throttling positive semidefinite zero forcing propagation time on graphs
- On generalized Petersen graphs labeled with a condition at distance two
- Independent domination in hypercubes
- The game of overprescribed Cops and Robbers played on graphs
- A note on \(k\)-cop, \(l\)-robber games on graphs
- Zero forcing sets and the minimum rank of graphs
- Various characterizations of throttling numbers
- (G1,G2)-permutation graphs
- The Domination Number of Grids
- Graphs with Given Group and Given Graph-Theoretical Properties
- Domination in Graphs Applied to Electric Power Networks
- Inverse Problems and Zero Forcing for Graphs
- Throttling for Zero Forcing and Variants
- The PMU Placement Problem
This page was built for publication: Product throttling
