Showing math.COShow all
2 papers · 1 filter
math.CO2023
Well-forced graphs
Cheryl Grood, Ruth Haas, Bonnie Jacob +2
A graph in which all minimal zero forcing sets are in fact minimum size is called ``well-forced." This paper characterizes well-forced trees and presents an algorithm for determini…
math.CO2022
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…