On consensus of star-composed networks with an application of Laplacian spectrum
DOI10.1155/2017/4619514zbMath1368.93239OpenAlexW2594466479WikidataQ59143182 ScholiaQ59143182MaRDI QIDQ2398768
Xing Chen, Haijun Jiang, Da Huang, Qiong Xiang Huang, Zhi-Yong Yu
Publication date: 21 August 2017
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/4619514
Laplacian spectrumconsensusbalanced complete bipartite graphrobustness for the communication networkstar-composed networks
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Sensitivity (robustness) (93B35) Deterministic network models in operations research (90B10) Eigenvalue problems (93B60) Decentralized systems (93A14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On reaching group consensus for linearly coupled multi-agent networks
- Generalized multi-synchronization viewed as a multi-agent leader-following consensus problem
- The Kirchhoff indices and the matching numbers of unicyclic graphs
- Quantitative function and algorithm for community detection in bipartite networks
- Network synchronization in a population of star-coupled fractional nonlinear oscillators
- Distributed Adaptive Control for Synchronization in Directed Complex Networks
- Synchronization in uncertain complex networks
- Optimally balanced spanning tree of the star network
- Node-to-node pinning control of complex networks
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Coherence in a family of tree networks with an application of Laplacian spectrum
- Consensus and Coherence in Fractal Networks
- The Spectrum of the Corona of Two Graphs
- The Laplacian spectrum of corona of two graphs
This page was built for publication: On consensus of star-composed networks with an application of Laplacian spectrum
