3 papers
math.CO2025
Well-failed graphs
Bonnie Jacob
In this paper we begin the study of well-failed graphs, that is, graphs in which every maximal failed zero forcing set is a maximum failed zero forcing set, or equivalently, in whi…
math.CO2023
Well-forced graphs
Cheryl Grood, Ruth Haas, Bonnie Jacob +2
A graph in which all minimal zero forcing sets are in fact minimum size is called ``well-forced." This paper characterizes well-forced trees and presents an algorithm for determini…
math.CO2023
The zero forcing span of a graph
Bonnie Jacob
In zero forcing, the focus is typically on finding the minimum cardinality of any zero forcing set in the graph; however, the number of cardinalities between and the number of…