1. What have the authors contributed in "Enhancing the network synchronizability" ?
This article offers a brief review of one focal issue concerning the structural and dynamical behaviors of complex network synchronization.. In the presentation, the notions of synchronization of dynamical systems on networks, stability of dynamical networks, and relationships between network structure and synchronizability, will be first introduced.
read more
![Fig. 6 (Color online) Changes of the synchronizability as a function of the proportion of the cut-edges Ncut/N , for different values of the average distance (after Ref. [46]).](/figures/fig-6-color-online-changes-of-the-synchronizability-as-a-1506oq8b.webp)
![Fig. 7 (color online) (a) R in the parameter plane (α, β); (b) R versus α for different values of the parameter β. The numerical simulations are implemented based on a BA network of size N = 1024 with average degree k̄ = 6 (after Ref. [50]).](/figures/fig-7-color-online-a-r-in-the-parameter-plane-a-b-b-r-versus-9fpgcah5.webp)
![Fig. 9 (color online) The eigenratio R versus the parameter α when β = 1.0, for several BA network configurations of size N = 1024 with average degree k̄ = 6. Each color represents one configuration (after Ref. [50]).](/figures/fig-9-color-online-the-eigenratio-r-versus-the-parameter-a-3pjtewfp.webp)
![Fig. 1 Sketch maps for the 3-division process on x0. The solid circle on the left is the node x0 with degree 6. After the 3-division process, x0 is divided into 3 nodes, x0, x1 and x2, that are fully connected each other. The six-edge incident from x0 redistribute over these three nodes (after Ref. [37]).](/figures/fig-1-sketch-maps-for-the-3-division-process-on-x0-the-solid-1k5pyzlk.webp)
![Fig. 10 (color online) The eigenratio R versus the parameter α, when β = 1.0, for the generalized BA networks with different assortative coefficients r (after Ref. [50]).](/figures/fig-10-color-online-the-eigenratio-r-versus-the-parameter-a-2vjlmvp9.webp)
![Fig. 3 The average distance L′ and maximal degree k′max in G(ρ,m) versus ρ. Here, L and kmax denote the average distance and maximal degree in the original network G. The relative changes L′/L and k′max/kmax are plotted using squares and circles, respectively. It is clear that the dividing processes reduce the maximal degree while increase the average distance (after Ref. [37]).](/figures/fig-3-the-average-distance-l-and-maximal-degree-kmax-in-g-r-3nfuvmui.webp)