Vertex labeling and routing in expanded Apollonian networks
Physics and Society
2011-11-09 v1
Abstract
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 vertices that allows to determine a shortest path routing between any two vertices of the network based only on the labels.
Keywords
Cite
@article{arxiv.physics/0610281,
title = {Vertex labeling and routing in expanded Apollonian networks},
author = {Zhongzhi Zhang and Francesc Comellas and Guillaume Fertin and André Raspaud and Lili Rong and Shuigeng Zhou},
journal= {arXiv preprint arXiv:physics/0610281},
year = {2011}
}
Comments
16 pages, 2 figures