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.

16 pages, 2 figures

References in corpus (12)

• The structure and function of complex networks
• Maximal planar networks with large clustering coefficient and power-law degree distribution
• Self-similar disk packings as model spatial scale-free networks
• A deterministic small-world network created by edge iterations
• Recursive graphs with small-world scale-free properties
• High dimensional random Apollonian networks
• High Dimensional Apollonian Networks
• Evolving Apollonian Networks with Small-world Scale-free topologies
• Evolving small-world networks with geographical attachment preference
• Walks on Apollonian networks
• Correlations in random Apollonian network
• A geometric growth model interpolating between regular and small-world networks

Cited by in corpus (3)

• Exact solution of mean geodesic distance for Vicsek fractals
• Random Sierpinski network with scale-free small-world and modular structure
• The rigorous solution for the average distance of a Sierpinski network