5 papers
Sharp Nordhaus-Gaddum bounds for throttling
Ryan Blair, Gabriel Elvin, Veronika Furst +2
Throttling is a graph optimization problem, where the throttling number of a graph is the minimum sum or minimum product of the number of vertices in an initial set and the time re…
Zero forcing irredundant sets
Bryan A. Curtis, Leslie Hogben, Adriana Roux
Irredundance has been studied in the context of dominating sets, via the concept of private neighbor. Here irredundance of zero forcing sets is introduced via the concept of a priv…
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…
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…
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…