14 citations · 45 across the 12 of their papers we have counts for
14 papers
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…
Power domination reconfiguration
Beth Bjorkman, Chassidy Bozeman, Daniela Ferrero +5
The study of token addition and removal and token jumping reconfiguration graphs for power domination is initiated. Some results established here can be extended by applying the me…
Product Throttling
Sarah E. Anderson, Karen L. Collins, Daniela Ferrero +4
Throttling addresses the question of minimizing the sum or the product of the resources used to accomplish a task and the time needed to complete that task for various graph search…
Product throttling for power domination
Sarah E. Anderson, Karen L. Collins, Daniela Ferrero +4
The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power…
Rigid linkages and partial zero forcing
Daniela Ferrero, Mary Flagg, H. Tracy Hall +5
Connections between vital linkages and zero forcing are established. Specifically, the notion of a rigid linkage is introduced as a special kind of unique linkage and it is shown t…
The zero forcing polynomial of a graph
Kirk Boyer, Boris Brimkov, Sean English +5
Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices, a colored vertex with a single uncolored neighbor causes that neighbor to beco…