The spectral radius of a graph is the maximum eigenvalues of its adjacency matrix. In this paper, using the property of quotient graph, the sharp upper bounds for the spectral radii of some adhesive graphs are determi...The spectral radius of a graph is the maximum eigenvalues of its adjacency matrix. In this paper, using the property of quotient graph, the sharp upper bounds for the spectral radii of some adhesive graphs are determined.展开更多
This paper investigates the controllability of general linear discrete-time multi-agent systems with directed and weighted signed networks by using graphic and algebraic methods.The nondelay and delay cases are consid...This paper investigates the controllability of general linear discrete-time multi-agent systems with directed and weighted signed networks by using graphic and algebraic methods.The nondelay and delay cases are considered respectively.For the case of no time delay,the upper bound condition of the controllable subspace is given by using the equitable partition method,and the influence of coefficient matrix selection of individual dynamics is illustrated.For the case of single delay and multiple delays,the equitable partition method is extended to deal with time-delay systems,and some conclusions are obtained.In particular,some simplified algebraic criteria for controllability of systems with time delay are obtained by using augmented system method and traditional algebraic controllability criteria.展开更多
文摘The spectral radius of a graph is the maximum eigenvalues of its adjacency matrix. In this paper, using the property of quotient graph, the sharp upper bounds for the spectral radii of some adhesive graphs are determined.
基金the National Natural Science Foundation of China under Grant Nos.61873136 and 62033007Taishan Scholars Climbing Program of Shandong Province of China and Taishan Scholars Project of Shandong Province of China under Grant No.ts20190930。
文摘This paper investigates the controllability of general linear discrete-time multi-agent systems with directed and weighted signed networks by using graphic and algebraic methods.The nondelay and delay cases are considered respectively.For the case of no time delay,the upper bound condition of the controllable subspace is given by using the equitable partition method,and the influence of coefficient matrix selection of individual dynamics is illustrated.For the case of single delay and multiple delays,the equitable partition method is extended to deal with time-delay systems,and some conclusions are obtained.In particular,some simplified algebraic criteria for controllability of systems with time delay are obtained by using augmented system method and traditional algebraic controllability criteria.
