Article ID Journal Published Year Pages File Type
6422007 Applied Mathematics and Computation 2012 5 Pages PDF
Abstract

A sufficient condition of adaptive synchronization in dynamical networks with coupling delays is gained, where the coupling configuration corresponds to a weighted graph. One can reduce edges to original graph such that the network more quickly achieves synchronization. Numerical simulations are given to illustrate the efficiency of theoretical results.

Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Authors
, , , ,