Positive semidefinite propagation time

DOI10.1016/j.dam.2015.04.008zbMath1327.05128OpenAlexW1494698208MaRDI QIDQ897615

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

zbMATH Keywords

positive semidefinitematrixminimum rankmaximum nullityzero forcing number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (20)

Computational approaches for zero forcing and related problems ⋮ Fractional zero forcing via three-color forcing games ⋮ Upper bounds for positive semidefinite propagation time ⋮ Compressed cliques graphs, clique coverings and positive zero forcing ⋮ Various characterizations of throttling numbers ⋮ Throttling processes equivalent to full throttling on trees ⋮ An integer program for positive semidefinite zero forcing in graphs ⋮ Throttling positive semidefinite zero forcing propagation time on graphs ⋮ A New Lower Bound for Positive Zero Forcing ⋮ The zero forcing polynomial of a graph ⋮ Propagation time for probabilistic zero forcing ⋮ On the error of \textit{a priori} sampling: zero forcing sets and propagation time ⋮ Complexity and computation of connected zero forcing ⋮ Throttling for the game of cops and robbers on graphs ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ Effects of vertex degrees on the zero-forcing number and propagation time of a graph ⋮ Positive semidefinite zero forcing numbers of two classes of graphs ⋮ Product throttling ⋮ Power domination throttling ⋮ Using Markov chains to determine expected propagation time for probabilistic zero forcing

Uses Software

• SageMath
• GitHub

Cites Work

• A technique for computing the zero forcing number of a graph with a cut-vertex
• Propagation time for zero forcing on a graph
• Zero forcing parameters and minimum rank problems
• Positive semidefinite zero forcing
• Zero forcing sets and the minimum rank of graphs
• Iteration Index of a Zero Forcing Set in a Graph
• Positive semidefinite maximum nullity and zero forcing number
• Nondiscriminatory propagation on trees
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
• Unnamed Item

This page was built for publication: Positive semidefinite propagation time