期刊
PHYSICA D-NONLINEAR PHENOMENA
卷 237, 期 7, 页码 1006-1012出版社
ELSEVIER
DOI: 10.1016/j.physd.2007.12.003
关键词
complex network; subgraph; complementary graph; synchronizability
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据