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...