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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
