Network synchronizability analysis: the theory of subgraphs and complementary graphs

08/05/2007
by   Zhisheng Duan, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/10/2018

Efficient Enumeration of Bipartite Subgraphs in Graphs

Subgraph enumeration problems ask to output all subgraphs of an input gr...
research
05/05/2021

The ratio of the numbers of odd and even cycles in outerplanar graphs

In this paper, we investigate the ratio of the numbers of odd and even c...
research
01/28/2022

Graph autoencoder with constant dimensional latent space

Invertible transformation of large graphs into constant dimensional vect...
research
08/24/2020

Atomic subgraphs and the statistical mechanics of networks

We develop random graph models where graphs are generated by connecting ...
research
08/07/2023

On the Perception of Small Sub-graphs

Interpreting a node-link graph is enhanced if similar subgraphs (or moti...
research
08/24/2018

Future Automation Engineering using Structural Graph Convolutional Neural Networks

The digitalization of automation engineering generates large quantities ...
research
04/09/2018

Juniper: A Tree+Table Approach to Multivariate Graph Visualization

Analyzing large, multivariate graphs is an important problem in many dom...

Please sign up or login with your details

Forgot password? Click here to reset