Zero forcing with random sets

DOI10.1016/j.disc.2024.113944arXiv2208.12899OpenAlexW4392337806MaRDI QIDQ6204353

Sam Spiro, Rachel Lawrence, Luyining Gan, Jamie Haddock, Bryan A. Curtis

Publication date: 27 March 2024

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

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

zbMATH Keywords

random graphszero forcing polynomialgraph thresholdrandom set zero forcing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• A technique for computing the zero forcing number of a graph with a cut-vertex
• Minimum rank of skew-symmetric matrices described by a graph
• Zero forcing parameters and minimum rank problems
• Threshold functions
• The zero forcing polynomial of a graph
• Bounds on expected propagation time of probabilistic zero forcing
• Tight bounds on probabilistic zero forcing on hypercubes and grids
• Probabilistic zero forcing on random graphs
• Zero-forcing in random regular graphs
• Zero forcing sets and the minimum rank of graphs
• Power domination in graphs
• Introduction to Random Graphs
• Using Markov chains to determine expected propagation time for probabilistic zero forcing
• Cores and shells of graphs
• Probabilistic Zero Forcing in Graphs
• Inverse Problems and Zero Forcing for Graphs
• Propagation time for probabilistic zero forcing

This page was built for publication: Zero forcing with random sets