14 citations · 14 across the 11 of their papers we have counts for
14 papers
The Zero Forcing Number of Graph Powers
Aida Abiad, Mary Flagg, Sina Ghasemi Nezhad +1
The -th power of a simple graph , denoted , is the graph with vertex set where two vertices are adjacent if they are within distance in . We investigate th…
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…
TAR reconfiguration for vertex set parameters
Bryan A. Curtis, Mary Flagg, Leslie Hogben
This paper surveys results about token addition and removal (TAR) reconfiguration for several well-known vertex set parameters including domination, power domination, standard zero…