8 papers
Forts, (fractional) zero forcing, and Cartesian products of graphs
Thomas R. Cameron, Leslie Hogben, Franklin H. J. Kenter +2
The (disjoint) fort number and fractional zero forcing number are introduced and related to existing parameters including the (standard) zero forcing number. The fort hypergraph is…
New Results on Difference Distance Magic Labelings
Roza Aceska, Niny Arcila-Maya, Joshua Carlson +5
A graph labeling assigns values to the components of a graph (vertices, edges, etc.). In particular, distance magic labelings have been widely studied in undirected graphs. In such…
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…
Zero Forcing and Vertex Independence Number on Cubic and Subcubic Graphs
Houston Schuerger, Nathan Warnberg, Michael Young
Motivated by a conjecture from the automated conjecturing program TxGraffiti, in this paper the relationship between the zero forcing number, , and the vertex independence nu…
The Zero Forcing Numbers of Peony Graphs and Web Graphs
Sara Anderton, Kanno Mizozoe, Houston Schuerger +1
The concept of zero forcing involves a dynamic coloring process by which blue vertices cause white vertices to become blue, with the goal of forcing the entire graph blue while cho…