Positive semidefinite propagation time

DOI10.1016/J.DAM.2015.04.008MaRDI QIDQ897615zbMATHOpenAlexFDO

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

zbMATH Keywords

matrixmaximum nullityminimum rankpositive semidefinitezero forcing number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Throttling positive semidefinite zero forcing propagation time on graphs
• Propagation time for zero forcing on a graph
• Zero forcing propagation time on oriented graphs
• Positive semidefinite zero forcing
• Upper bounds for positive semidefinite propagation time

Cites work

• A technique for computing the zero forcing number of a graph with a cut-vertex
• Iteration index of a zero forcing set in a graph
• Nondiscriminatory propagation on trees
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Positive semidefinite maximum nullity and zero forcing number
• Positive semidefinite zero forcing
• Propagation time for zero forcing on a graph
• Throttling zero forcing propagation speed on graphs
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs

Cited in

(22)

• Positive semidefinite zero forcing numbers of two classes of graphs
• Throttling positive semidefinite zero forcing propagation time on graphs
• The zero forcing polynomial of a graph
• Complexity and computation of connected zero forcing
• On the error of \textit{a priori} sampling: zero forcing sets and propagation time
• A New Lower Bound for Positive Zero Forcing
• Throttling processes equivalent to full throttling on trees
• Computational approaches for zero forcing and related problems
• Various characterizations of throttling numbers
• Positivity in time dependent linear transport theory
• Propagation time for probabilistic zero forcing
• On the zero forcing number of a graph involving some classical parameters
• 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
• scientific article; zbMATH DE number 2086480 (Why is no real title available?)
• An integer program for positive semidefinite zero forcing in graphs
• Throttling for the game of cops and robbers on graphs
• Product throttling
• Fractional zero forcing via three-color forcing games
• Compressed cliques graphs, clique coverings and positive zero forcing
• Power domination throttling
• Upper bounds for positive semidefinite propagation time

Describes a project that uses

Uses Software

• SageMath
• GitHub

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)