| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1897994 | Physica D: Nonlinear Phenomena | 2008 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Zhisheng Duan, Chao Liu, Guanrong Chen,