2 citations · 6 across the 9 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.CO2022★ 1 cited
Computer assisted discovery: Zero forcing vs vertex cover
Boris Brimkov, Randy Davila, Houston Schuerger +1
In this paper, we showcase the process of using an automated conjecturing program called \emph{TxGraffiti} written and maintained by the second author. We begin by proving a conjec…
math.CO2022★ 1 cited
Minimal Zero Forcing Sets
Boris Brimkov, Joshua Carlson
In this paper, we study minimal (with respect to inclusion) zero forcing sets. We first investigate when a graph can have polynomially or exponentially many distinct minimal zero f…