Cluster synchronization in a network of non-identical dynamic systems is studied in this paper, using two-cluster synchronization for detailed analysis and discussion. The results show that the common intercluster coupling condition is not always needed for the diffusively coupled network. Several sufficient conditions are obtained by using the Schur unitary triangularization theorem, which extends previous results. Some numerical examples are presented for illustration.
An evolutionary network driven by dynamics is studied and applied to the graph coloring problem.From an initial structure,both the topology and the coupling weights evolve according to the dynamics.On the other hand,the dynamics of the network are determined by the topology and the coupling weights,so an interesting structure-dynamics co-evolutionary scheme appears.By providing two evolutionary strategies,a network described by the complement of a graph will evolve into several clusters of nodes according to their dynamics.The nodes in each cluster can be assigned the same color and nodes in different clusters assigned different colors.In this way,a co-evolution phenomenon is applied to the graph coloring problem.The proposed scheme is tested on several benchmark graphs for graph coloring.
