2000 character limit reached
Network synchronizability analysis: the theory of subgraphs and complementary graphs
Published 5 Aug 2007 in cs.NI and cs.GR | (0708.0660v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.