Scale-free and small-world properties of hollow cube networks

In this paper, we construct the evolving networks from hollow cube in fractal geometry by encoding. We set the unit cubes as nodes of network, where two nodes are neighbors if and only if their corresponding cubes have common surface. We also study some characteristics of the network, such as degree distribution, clustering coefficient and average path length. We obtain this network with small world and scale-free properties by the self-similar structure.