3 papers
math.CO2025
Zero forcing propagation time intervals and graphs with fixed propagation time
Daniela Ferrero, H. Tracy Hall, Leslie Hogben +2
Zero forcing in a graph refers to the evolution of vertex states under repeated application of a color change rule. Typically the states are chosen to be blue and white, and a forc…
math.CO2025
Reconfiguration of Minimum PSD Forcing Sets and Minimum Skew Forcing Sets
Novi Bong, Mary Flagg, Mark Hunnell +4
Reconfiguration graphs provide a way to represent relationships among solutions to a problem, and have been studied in many contexts. We investigate the reconfiguration graphs corr…
math.CO2024
A Characterization of Claw-Free Graphs using Zero Forcing Invariants
Randy Davila, Houston Schuerger, Ben Small
We prove that the \emph{standard zero forcing number} and the \emph{positive semidefinite zero forcing number} are equal for all claw-free graphs . This result r…