In this paper, we study finite-time (FET) and fixed-time (FDT) bipartite synchronization of complex networks (CNs) with signed graphs. Under the framework of signed graphs, the interactions between nodes can be either collaborative or antagonistic, which are different from the traditional CNs. Two types of control schemes without the sign function are designed to realize FET and FDT bipartite synchronization of CNs, respectively. By 1-norm analytical techniques and Lyapunov functional method, FET bipartite synchronization criterion is established. By means of the constructed comparison system, FDT bipartite synchronization is proved. In addition, the settling times of both FET synchronization and FDT synchronization are estimated. It is worth noting that the settling time of FDT bipartite synchronization is not related to the initial values. Moreover, numerical simulations are given to illustrate the new results.

在本文中，我们研究了带有符号图的复杂网络（CN）的有限时间（FET）和固定时间（FDT）双向同步。在签名图的框架下，节点之间的交互可以是协作的也可以是对抗的，这与传统的CN有所不同。设计了两种没有符号功能的控制方案，分别实现CN的FET和FDT双向同步。通过1-范数分析技术和Lyapunov函数法，建立了FET双向同步准则。通过构造的比较系统，证明了FDT的二分同步。此外，还估算了FET同步和FDT同步的建立时间。值得注意的是，FDT双向同步的建立时间与初始值无关。