Throttling zero forcing propagation speed on graphs

zbMATH Open1293.05220MaRDI QIDQ2866604FDOQ2866604

Authors: Steve Butler, Michael Young 

Publication date: 13 December 2013

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

Recommendations

• Throttling for zero forcing and variants
• Effects of vertex degrees on the zero-forcing number and propagation time of a graph
• Zero forcing propagation time on oriented graphs
• Throttling positive semidefinite zero forcing propagation time on graphs
• Propagation time for zero forcing on a graph

zbMATH Keywords

speed of propagationzero forcing number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Cited In (31)

• Propagation time for probabilistic zero forcing
• The extremal function and Colin de Verdière graph parameter
• Maximum nullity, zero forcing number and propagation time of \(\ell\)-path graphs
• The zero forcing polynomial of a graph
• Leaky forcing: a new variation of zero forcing
• On the error of \textit{a priori} sampling: zero forcing sets and propagation time
• Properties of a \(q\)-analogue of zero forcing
• Using Markov chains to determine expected propagation time for probabilistic zero forcing
• Fuzzification of Zero Forcing Process
• 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
• Logic circuits from zero forcing
• Skew throttling
• The zero forcing span of a graph
• Propagation time for zero forcing on a graph
• 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
• Positive semidefinite propagation time
• Zero forcing with random sets
• Connected zero forcing sets and connected propagation time of graphs
• Throttling for zero forcing and variants
• Throttling for standard zero forcing on directed graphs
• Product throttling
• Power domination throttling
• Title not available (Why is that?)
• The \(q\)-analogue of zero forcing for certain families of graphs
• Various characterizations of throttling numbers
• Bounds on expected propagation time of probabilistic zero forcing
• An integer program for positive semidefinite zero forcing in graphs
• Zero forcing propagation time on oriented graphs

This page was built for publication: Throttling zero forcing propagation speed on graphs

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