Probabilistic zero forcing on random graphs

DOI10.1016/j.ejc.2020.103207zbMath1459.05301arXiv1909.06568OpenAlexW3061202589MaRDI QIDQ2225411

Sean English, Paweł Prałat, Calum MacRury

Publication date: 8 February 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.06568

zbMATH Keywords

random graphcoloringzero forcing

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

On the zero forcing number and spectral radius of graphs ⋮ Zero forcing with random sets ⋮ Bounds on expected propagation time of probabilistic zero forcing ⋮ Propagation time for probabilistic zero forcing ⋮ Tight bounds on probabilistic zero forcing on hypercubes and grids

Cites Work

• Unnamed Item
• Unnamed Item
• Propagation time for zero forcing on a graph
• Zero forcing parameters and minimum rank problems
• Complexity and computation of connected zero forcing
• The probabilistic and reliable connected power dominating set problems
• Zero forcing sets and the minimum rank of graphs
• Power domination in graphs
• Randomized rumor spreading in poorly connected small-world networks
• Introduction to Random Graphs
• Using Markov chains to determine expected propagation time for probabilistic zero forcing
• The Zero Forcing Number of Graphs
• Probabilistic Zero Forcing in Graphs
• Bounds for the Zero Forcing Number of Graphs with Large Girth
• Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
• The diameter of sparse random graphs

This page was built for publication: Probabilistic zero forcing on random graphs