Vertex labeling and routing in expanded Apollonian networks

DOI10.1088/1751-8113/41/3/035004MaRDI QIDQ5440355zbMATH OpenOpenAlexFDO

Authors Zhongzhi Zhang, Francesc Comellas, Guillaume Fertin, Lili Rong, Shuigeng Zhou, André Raspaud

Publication date 4 February 2008

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/physics/0610281

zbMATH Keywords

shortest path routing

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

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.

Recommendations

• Vertex labeling and routing for Farey-type symmetrically-structured graphs
• Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks
• Structure properties of Koch networks based on networks dynamical systems
• THREE-DIMENSIONAL APOLLONIAN NETWORKS
• Label-based routing for a family of scale-free, modular, planar and unclustered graphs

Cited in

(3)

• Structure properties of Koch networks based on networks dynamical systems
• Vertex labeling and routing for Farey-type symmetrically-structured graphs
• Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks

This page was built for publication: Vertex labeling and routing in expanded Apollonian networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5440355)