Strong Targeted Controllability of Switching Signed Networks

Abstract

This brief studies the strong targeted controllability of switching signed networks. We investigate the controllability from the union digraph perspective and provide a graph theoretic sufficient condition. It is shown that a switching signed network is strongly targeted controllable if the union graph satisfies certain properties. Our main result is applicable to switching signed networks with arbitrary coupling weights and number of leaders. Finally, an example is given to demonstrate the effectiveness of the theoretical result.