In this article, the consensus-related performances of the triplex multi-agent systems with star-related structures, which can be measured by the algebraic connectivity and network coherence, have been studied by the characterization of Laplacian spectra. Some notions of graph operations are introduced to construct several triplex networks with star substructures. The methods of graph spectra are applied to derive the network coherence, and some asymptotic behaviors of the indices have been derived. It is found that the operations of adhering star topologies will make the first-order coherence increase a constant value under the triplex structures as parameters tend to infinity, and the second-order coherence have some equality relations as the node related parameters tend to infinity. Finally, the consensus related indices of the triplex systems with the same number of nodes but non-isomorphic graph structures have been compared and simulated to verify the results.

The system model on synchronizability problem of complex networks with multi-layer structure is closer to the real network than the usual single-layer case. Based on the master stability equation (MSF), this paper studies the eigenvalue spectrum of two k-layer variable coupling windmill-type networks. In the case of bounded and unbounded synchronization domain, the relationships between the synchronizability of the layered windmill-type networks and network parameters, such as the numbers of nodes and layers, inter-layers coupling strength, are studied. The simulation of the synchronizability of the layered windmill-type networks are given, and they verify the theoretical results well. Finally, the optimization schemes of the synchronizability are given from the perspective of single-layer and multi-layer networks, and it was found that the synchronizability of the layered windmill-type networks can be improved by changing the parameters appropriately.

In this article, the convergence speed and robustness of the consensus for several dual-layered star-composed multi-agent networks are studied through the method of graph spectra. The consensus-related indices, which can measure the performance of the coordination systems, refer to the algebraic connectivity of the graph and the network coherence. In particular, graph operations are introduced to construct several novel two-layered networks, the methods of graph spectra are applied to derive the network coherence for the multi-agent networks, and we find that the adherence of star topologies will make the first-order coherence of the dual-layered systems increase some constants in the sense of limit computations. In the second-order case, asymptotic properties also exist when the index is divided by the number of leaf nodes. Finally, the consensus-related indices of the duplex networks with the same number of nodes but non-isomorphic structures have been compared and simulated, and it is found that both the first-order coherence and second-order coherence of the network D are between A and B, and C has the best first-order robustness, but it has the worst robustness in the second-order case.

In the research on complex networks, synchronizability is a significant measurement of network nature. Several research studies center around the synchronizability of single-layer complex networks and few studies on the synchronizability of multi-layer networks. Firstly, this paper calculates the Laplacian spectrum of multi-layer dual-center coupled star networks and multi-layer dual-center coupled star–ring networks according to the master stability function (MSF) and obtains important indicators reflecting the synchronizability of the above two network structures. Secondly, it discusses the relationships among synchronizability and various parameters, and numerical simulations are given to illustrate the effectiveness of the theoretical results. Finally, it is found that the two sorts of networks studied in this paper are of the same synchronizability, and compared with that of a single-center network structure, the synchronizability of two dual-center structures is relatively weaker.

This paper studies a generalized distributed optimization problem for second-order multi-agent systems (MASs) over directed networks. Firstly, an improved distributed continuous-time algorithm is proposed. By using the linear transformation method and Lyapunov stability theory, some conditions are obtained to guarantee all agents’ states asymptotically reach the optimal solution. Secondly, to reduce unnecessary communication transmission and control cost, an event-triggered algorithm is designed. Moreover, the convergence of the algorithm is proved, and the Zeno behavior can be avoided based on strict theoretic analysis. Finally, one example is given to verify the good performance of the proposed algorithms.

The topological properties of the networks can be described by the Laplacian spectra, but resolving the Laplacian spectra of networks poses difficulties. In this study, a novel approach for solving the Laplacian spectrum of weighted composite networks is presented. We first give the definitions of three weighted graph operations, namely, Cartesian product, corona, and join. Second, the Laplacian spectra of these composite networks are calculated. Finally, we use the obtained Laplacian spectrum to deduce some topological properties of the networks, such as network coherence, entire mean first-passage time, and Laplacian energy, which have several applications in physical chemistry.