Throttling positive semidefinite zero forcing propagation time on graphs

DOI10.1016/j.dam.2018.06.017zbMath1404.05050arXiv1807.09404OpenAlexW2852966701MaRDI QIDQ1720308

Vicente Valle Martinez, Michael S. Ross, Seth Selken, Jürgen Kritschgau, Joshua Carlson, Leslie Hogben, Kate J. Lorenzen

Publication date: 8 February 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

positive semidefinitezero forcingpropagation timethrottling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (15)

Throttling for Zero Forcing and Variants ⋮ Various characterizations of throttling numbers ⋮ Throttling for standard zero forcing on directed graphs ⋮ Throttling processes equivalent to full throttling on trees ⋮ On the zero blocking number of rectangular, cylindrical, and Möbius grids ⋮ An integer program for positive semidefinite zero forcing in graphs ⋮ Blocking zero forcing processes in Cartesian products of graphs ⋮ Unnamed Item ⋮ The zero forcing polynomial of a graph ⋮ On the error of \textit{a priori} sampling: zero forcing sets and propagation time ⋮ Throttling for the game of cops and robbers on graphs ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ Skew throttling ⋮ Product throttling ⋮ Power domination throttling

Cites Work

• Fast-mixed searching and related problems on graphs
• Propagation time for zero forcing on a graph
• Positive semidefinite propagation time
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs
• Nondiscriminatory propagation on trees
• Unnamed Item

This page was built for publication: Throttling positive semidefinite zero forcing propagation time on graphs