eZ2DbLFHsgnz4zIoDvU3KrlWEpjn8h2sSgtTTBXYYDQ9XBWPJQvxP76NLQQZ
Current position: Home >> Scientific Research >> Paper Publications

Vertex labeling and routing in expanded Apollonian networks

Release Time:2019-03-10  Hits:

Indexed by: Journal Article

Date of Publication: 2008-01-25

Journal: JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL

Included Journals: SCIE

Volume: 41

Issue: 3

ISSN: 1751-8113

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 nodes that allows one to determine the shortest path routing between any two nodes of the network based only on the labels.

Prev One:Effect attack on scale-free networks due to cascading failures

Next One:具有无尺度拓扑与小世界效应的Sierpinski网络