7 papers · 1 filter
Transmission Zero Forcing
Adam H. Berliner, Chassidy Bozeman, Karen L. Collins +3
We initiate the study of transmission zero forcing, a variant of the well-studied zero forcing graph parameter. In this variant, a subset of vertices is assigned an initial unit we…
A strong nullity parameter for rooted graphs
Aida Abiad, Mary Flagg, H. Tracy Hall +2
The inverse eigenvalue problem of a graph studies the possible spectra of matrices associated with , including as an important subproblem the possible nullities of such a ma…
Universal perspectives on irredundance for X-set parameters
Bryan Curtis, Mary Flagg, Leslie Hogben
Universal definitions of irredundance for X-set parameters are presented using blocking sets. This approach is modeled on (domination) irredundance (which uses closed neighborhoods…
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…
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…
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…