Abstract
The paper investigates bipartite synchronization (BS) and bounded bipartite synchronization (BBS) of a network of identical linear systems with antagonistic interactions and time-varying topologies. When at each time instant all agents can be divided into two hostile camps, and the members of two hostile camps are unchanged as time goes on, we obtain some sufficient conditions for bipartite synchronization under mild assumption that the signed graph is uniformly quasi-strongly connected. When the members of hostile camps are changed as time goes on, or at some time instants all agents cannot be divided into two hostile camps, we consider this network as a perturbation of a particular network which can achieve bipartite synchronization. We obtain some sufficient conditions such that the network achieves bounded bipartite synchronization. Finally, we present two numerical examples to illustrate the effectiveness of the obtained results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
