Network synchronizability analysis: the theory of subgraphs and complementary graphs
classification
💻 cs.NI
cs.GR
keywords
networkgraphssubgraphssynchronizabilitycomplementaryanalysisanalyzeattainable
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.