Positive semidefinite propagation time
From MaRDI portal
Publication:897615
DOI10.1016/J.DAM.2015.04.008zbMATH Open1327.05128OpenAlexW1494698208MaRDI QIDQ897615FDOQ897615
Authors: Nathan Warnberg 
Publication date: 7 December 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.04.008
Recommendations
Cites Work
- Zero forcing sets and the minimum rank of graphs
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Zero forcing parameters and minimum rank problems
- Positive semidefinite zero forcing
- Iteration index of a zero forcing set in a graph
- Positive semidefinite maximum nullity and zero forcing number
- Nondiscriminatory propagation on trees
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Propagation time for zero forcing on a graph
- Throttling zero forcing propagation speed on graphs
Cited In (22)
- Propagation time for probabilistic zero forcing
- Positive semidefinite zero forcing numbers of two classes of graphs
- Upper bounds for positive semidefinite propagation time
- The zero forcing polynomial of a graph
- On the zero forcing number of a graph involving some classical parameters
- On the error of \textit{a priori} sampling: zero forcing sets and propagation time
- Using Markov chains to determine expected propagation time for probabilistic zero forcing
- Effects of vertex degrees on the zero-forcing number and propagation time of a graph
- Throttling for the game of cops and robbers on graphs
- Fractional zero forcing via three-color forcing games
- Compressed cliques graphs, clique coverings and positive zero forcing
- Throttling positive semidefinite zero forcing propagation time on graphs
- Throttling processes equivalent to full throttling on trees
- Computational approaches for zero forcing and related problems
- Complexity and computation of connected zero forcing
- A New Lower Bound for Positive Zero Forcing
- Product throttling
- Title not available (Why is that?)
- Positivity in time dependent linear transport theory
- Power domination throttling
- Various characterizations of throttling numbers
- An integer program for positive semidefinite zero forcing in graphs
Uses Software
This page was built for publication: Positive semidefinite propagation time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897615)
