Bounds for the Zero Forcing Number of Graphs with Large Girth
From MaRDI portal
Publication:5225511
DOI10.20429/tag.2015.020201zbMath1416.05169arXiv1406.0482OpenAlexW2963157019MaRDI 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
Related Items (29)
On the zero forcing number and spectral radius of graphs ⋮ Extremal values and bounds for the zero forcing number ⋮ Maximum nullity and zero forcing of circulant graphs ⋮ Total forcing sets and zero forcing sets in trees ⋮ Extremal \(k\)-forcing sets in oriented graphs ⋮ UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS ⋮ 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 ⋮ On a conjecture of Gentner and Rautenbach ⋮ The Zero Forcing Number of Graphs ⋮ Unnamed Item ⋮ Probabilistic zero forcing on random graphs ⋮ On the total forcing number of a graph ⋮ The forcing number of graphs with given girth ⋮ Bounds on the connected forcing number of a graph ⋮ Total forcing and zero forcing in claw-free cubic graphs ⋮ Propagation time for probabilistic zero forcing ⋮ Total forcing versus total domination in cubic graphs ⋮ Complexity and computation of connected zero forcing ⋮ Zero forcing versus domination in cubic 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 ⋮ A lower bound on the zero forcing number ⋮ Matching, path covers, and total forcing sets ⋮ Zero forcing in claw-free cubic graphs ⋮ Tight bounds on probabilistic zero forcing on hypercubes and grids ⋮ On extremal graphs for zero forcing number ⋮ Edge Forcing in Butterfly Networks
This page was built for publication: Bounds for the Zero Forcing Number of Graphs with Large Girth
