Plug-and-Play Network Reconfiguration Algorithms to Maintain Regularity and Low Network Reconfiguration Needs

In this letter we propose algorithms to connect and disconnect nodes to/from an existing graph, which are able to maintain the regularity of a graph while requiring minimal reconfiguration of the network. Further, simulations suggest that the algorithms maintain a minimum bound on the algebraic connectivity of the graph. These properties of the algorithms suit their use in plug-and-play networks.