中间性中心性
复杂网络
图论
拓扑(电路)
图形
中心性
计算机科学
网络分析
数学
网络拓扑
相互依存的网络
理论计算机科学
节点(物理)
学位分布
计算机网络
万维网
物理
结构工程
组合数学
量子力学
工程类
作者
Guanrong Chen,Zhisheng Duan
出处
期刊:Chaos
[American Institute of Physics]
日期:2008-09-01
卷期号:18 (3)
被引量:118
摘要
This paper addresses the fundamental problem of complex network synchronizability from a graph-theoretic approach. First, the existing results are briefly reviewed. Then, the relationships between the network synchronizability and network structural parameters (e.g., average distance, degree distribution, and node betweenness centrality) are discussed. The effects of the complementary graph of a given network and some graph operations on the network synchronizability are discussed. A basic theory based on subgraphs and complementary graphs for estimating the network synchronizability is established. Several examples are given to show that adding new edges to a network can either increase or decrease the network synchronizability. To that end, some new results on the estimations of the synchronizability of coalescences are reported. Moreover, a necessary and sufficient condition for a network and its complementary network to have the same synchronizability is derived. Finally, some examples on Chua circuit networks are presented for illustration.
科研通智能强力驱动
Strongly Powered by AbleSci AI