scientific article
From MaRDI portal
Publication:2866604
zbMath1293.05220MaRDI QIDQ2866604
No author found.
Publication date: 13 December 2013
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (24)
Throttling for Zero Forcing and Variants ⋮ Computational approaches for zero forcing and related problems ⋮ Various characterizations of throttling numbers ⋮ Throttling for standard zero forcing on directed graphs ⋮ Throttling processes equivalent to full throttling on trees ⋮ An integer program for positive semidefinite zero forcing in graphs ⋮ Positive semidefinite propagation time ⋮ Zero forcing with random sets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Throttling positive semidefinite zero forcing propagation time on graphs ⋮ The zero forcing polynomial of a graph ⋮ Bounds on expected propagation time of probabilistic zero forcing ⋮ The extremal function and Colin de Verdière graph parameter ⋮ Zero forcing propagation time on oriented graphs ⋮ Propagation time for probabilistic zero forcing ⋮ On the error of \textit{a priori} sampling: zero forcing sets and propagation time ⋮ Throttling for the game of cops and robbers on graphs ⋮ Effects of vertex degrees on the zero-forcing number and propagation time of a graph ⋮ Connected zero forcing sets and connected propagation time of graphs ⋮ Skew throttling ⋮ Product throttling ⋮ Power domination throttling ⋮ Using Markov chains to determine expected propagation time for probabilistic zero forcing
This page was built for publication:
