Zhang, Zhongzhi; Comellas, Francesc; Fertin, Guillaume; Raspaud, André; Rong, Lili; Zhou, Shuigeng Vertex labeling and routing in expanded Apollonian networks. (English) Zbl 1152.90359 J. Phys. A, Math. Theor. 41, No. 3, Article ID 035004, 10 p. (2008). Summary: We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale free, small world and highly clustered. We introduce a labeling of their nodes that allows one to determine the shortest path routing between any two nodes of the network based only on the labels. Cited in 1 Document MSC: 90B10 Deterministic network models in operations research Keywords:shortest path routing PDFBibTeX XMLCite \textit{Z. Zhang} et al., J. Phys. A, Math. Theor. 41, No. 3, Article ID 035004, 10 p. (2008; Zbl 1152.90359) Full Text: DOI arXiv