By using the random interchanging algorithm, we investigate the relations between average distance, standard deviation of degree distribution and synchronizability of complex networks. We find that both increasing the average distance and magnifying the degree deviation will make the network...

In this paper, we propose a simple rule that generates scale-free small-world networks with tunable assortative coefficient. These networks are constructed by two-stage adding process for each new node. The model can reproduce scale-free degree distributions and small-world effect. The...

In this paper, we investigate percolation in a sort of networks inspired by the observation of a Collatz graph (CG) which is the network version of the famous 3x+1 problem in mathematics. The CG consists of positive integers that are connected based on the iteration relations. Actually, we never...

In this paper, the networks with optimal synchronizability are obtained using the local structure information. In scale-free networks, a node will be coupled by its neighbors with maximal degree among the neighbors if and only if the maximal degree is larger than its own degree. If the obtained...

Many social networks, apart from displaying scale-free characteristics observed in some instances, possess another remarkable feature that distinguishes them from those that appear in biological and technological context—assortativity. However, little or no attention has been payed to the...

The role of rich-club connectivity is significant in the structural property and functional behavior of complex networks. In this study, we find whether or not a very small portion of rich nodes connected to each other can strongly affect the frequency of occurrence of basic building blocks...