Vertex labeling and routing in expanded Apollonian networks
Tipus de documentArticle
Condicions d'accésAccés obert
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 a shortest path routing between any two nodes of the network based only on the labels.