Bounds for the Zero Forcing Number of Graphs with Large Girth

DOI10.20429/tag.2015.020201zbMath1416.05169arXiv1406.0482MaRDI QIDQ5225511

Randy Davila, Franklin H. J. Kenter

Publication date: 22 July 2019

Published in: Theory and Applications of Graphs (Search for Journal in Brave)

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

zbMATH Keywords

maximum nullity of all symmetric matrices with a sparsity pattern

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

Related Items

The Zero Forcing Number of Graphs, The forcing number of graphs with given girth, Edge Forcing in Butterfly Networks, Propagation time for probabilistic zero forcing, Matching, path covers, and total forcing sets, Unnamed Item, On graphs maximizing the zero forcing number, The zero forcing number of graphs with the matching number and the cyclomatic number, Bounding the total forcing number of graphs, Extremal values and bounds for the zero forcing number, On a conjecture of Gentner and Rautenbach, On the total forcing number of a graph, Bounds on the connected forcing number of a graph, Total forcing and zero forcing in claw-free cubic graphs, A lower bound on the zero forcing number, Total forcing versus total domination in cubic graphs, Complexity and computation of connected zero forcing, Zero forcing versus domination in cubic graphs, Tight bounds on probabilistic zero forcing on hypercubes and grids, On extremal graphs for zero forcing number, On the zero forcing number and spectral radius of graphs, Total forcing sets and zero forcing sets in trees, Probabilistic zero forcing on random graphs, A short proof for a lower bound on the zero forcing number, On the zero forcing number of a graph involving some classical parameters, Zero forcing in claw-free cubic graphs, Extremal \(k\)-forcing sets in oriented graphs, Maximum nullity and zero forcing of circulant graphs