Scale-free and small-world properties of Sierpinski networks

In this paper, we construct the evolving networks from Sierpinski carpet, using the encoding approach in fractal geometry. We consider the small similar copies of unit square as nodes of network, where two nodes are neighbors if and only if their corresponding copies have common surface. For our networks, we check their scale-free and small-world effect by the self-similar structures, the exponent of power-law on degree distribution is log38 which is the Hausdorff dimension of the carpet.