Forts, (fractional) zero forcing, and Cartesian products of graphs
Combinatorics
2026-02-05 v3
Abstract
The (disjoint) fort number and fractional zero forcing number are introduced and related to existing parameters including the (standard) zero forcing number. The fort hypergraph is introduced and hypergraph results on transversals and matchings are applied to the zero forcing number and fort number. These results are used to establish a Vizing-like lower bound for the zero forcing number of a Cartesian product of graphs for certain families of graphs, and a family of graphs achieving this lower bound is exhibited.
Keywords
Cite
@article{arxiv.2310.17904,
title = {Forts, (fractional) zero forcing, and Cartesian products of graphs},
author = {Thomas R. Cameron and Leslie Hogben and Franklin H. J. Kenter and Seyed Ahmad Mojallal and Houston Schuerger},
journal= {arXiv preprint arXiv:2310.17904},
year = {2026}
}