Network synchronizability analysis: The theory of subgraphs and complementary graphs

被引：30

作者：

Duan, Zhisheng ^{[1
]}

Liu, Chao ^{[1
]}

Chen, Guanrong ^{[1
,2
]}

机构：

[1] Peking Univ, Coll Engn, State Key Lab Turbulence & Complex Syst, Dept Mech & Aerosp Engn, Beijing 100871, Peoples R China

[2] City Univ Hong Kong, Dept Elect Engn, Hong Kong, Hong Kong, Peoples R China

来源：

PHYSICA D-NONLINEAR PHENOMENA | 2008年 / 237卷 / 07期

基金：

中国国家自然科学基金;

关键词：

complex network; subgraph; complementary graph; synchronizability;

D O I：

10.1016/j.physd.2007.12.003

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, subgraphs and complementary graphs are used to analyze network synchronizability. Some sharp and attainable bounds are derived for the eigenratio of the network structural matrix, which characterizes the network synchronizability, especially when the network's corresponding graph has cycles, chains, bipartite graphs or product graphs as its subgraphs. (C) 2007 Elsevier B.V. All rights reserved.

引用

页码：1006 / 1012

页数：7

共 31 条

[1] Network synchronization: Spectral versus statistical properties [J].