Power domination reconfiguration

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 methods used for power domination to reconfiguration graphs for other parameters such as domination and zero forcing, so these results are first established in a universal framework.

[1]  Naomi Nishimura,et al.  Introduction to Reconfiguration , 2018, Algorithms.

[2]  T. Baldwin,et al.  Power system observability with minimal phasor measurement placement , 1993 .

[3]  Karen Seyffarth,et al.  The k-Dominating Graph , 2012, Graphs Comb..

[4]  Tianshu BI,et al.  Phasor measurement units, WAMS, and their applications in protection and control of power systems , 2018, Journal of Modern Power Systems and Clean Energy.

[5]  Jesse Geneson,et al.  Reconfiguration graphs of zero forcing sets , 2020, Discret. Appl. Math..

[6]  Lenwood S. Heath,et al.  The PMU Placement Problem , 2005, SIAM J. Discret. Math..

[7]  Michael A. Henning,et al.  Domination in Graphs Applied to Electric Power Networks , 2002, SIAM J. Discret. Math..

[8]  Morteza Sarailoo,et al.  Cost-Effective Upgrade of PMU Networks for Fault-Tolerant Sensing , 2018, IEEE Transactions on Power Systems.

[9]  Michael A. Henning,et al.  A note on power domination in grid graphs , 2006, Discret. Appl. Math..