The Zero Forcing Number of Graphs

DOI10.1137/17M1133051zbMath1403.05137arXiv1705.10391OpenAlexW2909777159MaRDI QIDQ4610449

Nina Kamčev, Thomas Kalinowski, Benjamin Sudakov

Publication date: 16 January 2019

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

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

zbMATH Keywords

random graphsgraphs with large girthzero forcing sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (18)

On the zero forcing number and spectral radius of graphs ⋮ On trees and unicyclic graphs with equal forcing-type numbers ⋮ Multi-color forcing in graphs ⋮ Immune sets in monotone infection rules. Characterization and complexity ⋮ The zero forcing number of graphs with the matching number and the cyclomatic number ⋮ Bounding the total forcing number of graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Probabilistic zero forcing on random graphs ⋮ Uniform forcing and immune sets in graphs and hypergraphs ⋮ Constructions of cospectral graphs with different zero forcing numbers ⋮ Propagation time for probabilistic zero forcing ⋮ Rigid linkages and partial zero forcing ⋮ Unnamed Item ⋮ Note on forcing problem of trees ⋮ Tight bounds on probabilistic zero forcing on hypercubes and grids ⋮ A computational comparison of compact MILP formulations for the zero forcing number ⋮ Edge Forcing in Butterfly Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal values and bounds for the zero forcing number
• Upper bounds on the \(k\)-forcing number of a graph
• Expected values of parameters associated with the minimum rank of a graph
• Norm-graphs: Variations and applications
• Diffusion processes on graphs and the averaging principle
• The Moore bound for irregular graphs
• Some bounds on the zero forcing number of a graph
• A lower bound on the zero forcing number
• Zero forcing sets and the minimum rank of graphs
• Graph bootstrap percolation
• Anagram-Free Colourings of Graphs
• A proof of Alon’s second eigenvalue conjecture and related problems
• Dynamical Processes on Complex Networks
• Bounds for the Zero Forcing Number of Graphs with Large Girth
• Dynamic approach to k-forcing
• Contagious Sets in Expanders
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On a problem of K. Zarankiewicz
• On the structure of linear graphs

This page was built for publication: The Zero Forcing Number of Graphs