High Dimensional Apollonian Networks
  We propose a simple algorithm which produces high dimensional Apollonian networks with both small-world and scale-free characteristics. We derive analytical expressions for the degree distribution, the clustering coefficient and the diameter of the networks, which are determined by their dimension. 
Zhongzhi Zhang, Francesc Comellas, Guillaume Fertin, Lili Rong