arXiv · physics/0610281
Vertex labeling and routing in expanded Apollonian networks
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Zhongzhi Zhang, Francesc Comellas, Guillaume Fertin, André Raspaud, Lili Rong, Shuigeng Zhou. 2006-10-31. Vertex labeling and routing in expanded Apollonian networks. https://doi.org/10.1088/1751-8113%2F41%2F3%2F035004
Cite the original work for its findings. Save a collection to share your selection of sources.