A novel deterministic small-world network created by rectangle iterations

For the past few years, people have widely adopted complex network theories and methods on complex system and nonlinear dynamics, such as social network, ecological network, transportation network and so on. The complex warfare system is also no exception. Inspired by the famous OODA loop theory of military field, this paper proposes a deterministic network growth model based on the motif of rectangle. Because the clustering coefficient of network is zero, we construct small world network model through adding two non-intersect edges in the diagonal of rectangle. Combined with the characteristic of growth in real network, this paper proposes the generating algorithms of small world. Then we analyze the main topological properties, such as the degree and the degree distribution, average path length and clustering coefficient. The results show that our network has the characteristic of low average path length, high clustering and exponential degree distribution.