Effects of vertex degrees on the zero-forcing number and propagation time of a graph

DOI10.1016/J.DAM.2018.05.002MaRDI QIDQ1801062zbMATHOpenAlexWikidataFDO

Authors Caleb C. Fast, Illya V. Hicks

Publication date 26 October 2018

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

Full work available at URL https://doi.org/10.1016/j.dam.2018.05.002

zbMATH Keywords

propagation timeiteration indexzero-forcing numberzero-forcingforcing time

Mathematics Subject Classification ID

Vertex degrees (05C07) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Propagation time for zero forcing on a graph
• Connected zero forcing sets and connected propagation time of graphs
• Zero forcing propagation time on oriented graphs
• Throttling zero forcing propagation speed on graphs
• On the zero forcing number and propagation time of oriented graphs

Cites work

• Graph minors. X: Obstructions to tree-decomposition
• Iteration index of a zero forcing set in a graph
• Local controllability of quantum systems
• On minimum rank and zero forcing sets of a graph
• On the relationships between zero forcing numbers and certain graph coverings
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Positive semidefinite propagation time
• Probalistic zero forcing in graphs
• Propagation time for zero forcing on a graph
• Throttling zero forcing propagation speed on graphs
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs

Cited in

(14)

• Uniform forcing and immune sets in graphs and hypergraphs
• Throttling zero forcing propagation speed on graphs
• On the error of \textit{a priori} sampling: zero forcing sets and propagation time
• Computational approaches for zero forcing and related problems
• Connected zero forcing sets and connected propagation time of graphs
• On the zero blocking number of rectangular, cylindrical, and Möbius grids
• Blocking zero forcing processes in Cartesian products of graphs
• An integer program for positive semidefinite zero forcing in graphs
• Propagation time for zero forcing on a graph
• Immune sets in monotone infection rules. Characterization and complexity
• Leaky forcing: a new variation of zero forcing
• On the zero forcing number and propagation time of oriented graphs
• The strong spectral property of graphs: graph operations and barbell partitions
• Power domination throttling

This page was built for publication: Effects of vertex degrees on the zero-forcing number and propagation time of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801062)