Zero Forcing on 2-connected Outerplanar Graphs
Combinatorics
2023-08-23 v1
Abstract
We determine upper and lower bounds on the zero forcing number of 2-connected outerplanar graphs in terms of the structure of the weak dual. We show that the upper bound is always at most half the number of vertices of the graph. This work generalizes work of Hern\'andez, Ranilla and Ranilla-Cortina who proved a similar result for maximal outerplanar graphs.
Cite
@article{arxiv.2308.11517,
title = {Zero Forcing on 2-connected Outerplanar Graphs},
author = {Nolan Ison and Mark Kempton and Franklin Kenter},
journal= {arXiv preprint arXiv:2308.11517},
year = {2023}
}