1 citations · 1 across the 2 of their papers we have counts for
4 papers
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…
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…
New Structures and their Applications to Variants of Zero Forcing and Propagation Time
Leslie Hogben, Mark Hunnell, Kevin Liu +3
We introduce a generalization of the concept of a chronological list of forces, called a relaxed chronology. This concept is used to introduce a new way of formulating the standard…
The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions
Sarah Allred, Emelie Curl, Shaun Fallat +4
The utility of a matrix satisfying the Strong Spectral Property has been well established particularly in connection with the inverse eigenvalue problem for graphs. More recently t…