Network synchronizability analysis: the theory of subgraphs and complementary graphs

Chao Liu; Guanrong Chen; Zhisheng Duan

REVIEW

Network synchronizability analysis: the theory of subgraphs and complementary graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0708.0660 v1 pith:KWD65V7Z submitted 2007-08-05 cs.NI cs.GR

Network synchronizability analysis: the theory of subgraphs and complementary graphs

Zhisheng Duan , Chao Liu , Guanrong Chen This is my paper

classification cs.NI cs.GR

keywords networkgraphssubgraphssynchronizabilitycomplementaryanalysisanalyzeattainable

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

In this paper, subgraphs and complementary graphs are used to analyze the network synchronizability. Some sharp and attainable bounds are provided 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.

Network synchronizability analysis: the theory of subgraphs and complementary graphs

discussion (0)