supported in part by the Natural Science Foundation of Xinjiang Uygur Autonomous Region under Grant No.2023D01C162;in part by the National Natural Science Foundation of China under Grant Nos.62003289 and 62163035;in part by the China Postdoctoral Science Foundation under Grant No.2021M690400;in part by the Special Project for Local Science and Technology Development Guided by the Central Government under Grant No.ZYYD2022A05。
This paper studies the cluster consensus of multi-agent systems(MASs)with objective optimization on directed and detail balanced networks,in which the global optimization objective function is a linear combination of ...
supported by the State Key Research Project under Grant No.2018YFD0400902;the National Science Foundation under Grant No.61873112;the Education Ministry and China Mobile Science Research Foundation under Grant No.MCM20170204;Jiangsu Key Construction Laboratory of IoT Application Technology under Grant Nos.190449,190450。
For multi-agent systems with competitive and collaborative relationships,signed graph can more intuitively express the characteristics of their interactive networks.In this paper,the bipartite consensus is investigate...
supported by the National Natural Science Foundation of China under Grant Nos.61174141 and 61374025;Research Awards Young and Middle-Aged Scientists of Shandong Province under Grant Nos.BS2011SF009 and BS2011DX019;Excellent Youth Foundation of Shandong Province under Grant No.JQ201219
In this paper, the problem of consensus for continuous time singular systems of multi-agent networks is considered. The definition of r-consensus is introduced for singular systems of multi-agent networks. Firstly, li...
This research is supported by the National Natural Science of Foundation under Grant Nos.10531070 and 10721101 of China.
Let Gn,d be a random d-regular graph with n vertices, where d = o(n). Given a fixed graph H, YH denotes the number of induced copies of H in Gn d In this paper, the authors determine the threshold of the event "YH ...
Various random models with balanced data that are relevant for analyzing practical test data are described, along with several hypothesis testing and interval estimation problems concerning variance components. In thi...
This research is supported by the National Natural Science Foundation of China (No. 10371114).
In this paper, we study the existence of 0-1 universal minimal total dominating functions in a graph. We establish a formulation of linear inequalities to characterize universal minimal total dominating functions and ...
In this paper we prove the following: Let G be connected balanced bipartite graph of order 2n> 4. If G satisfies the localization condition |NZ(u)\N(v)| + 2 < d(u), for any u,v∈ V(G) and d(u, v) = 3 where N(u) = {w|w...