Vertex labeling and routing in expanded Apollonian networks

Details Vertex labeling and routing in expanded Apollonian networks Vertex labeling and routing in expanded Apollonian networks

2006-10-31

arxiv.org/abs/physics/0610281v1

J. Phys. A: Math. Theor. 41 (2008) 035004

Physics

Physics and Society

16 pages, 2 figures

Scientific paper

10.1088/1751-8113/41/3/035004

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.

Affiliated with

Also associated with

No associations

Rating

Vertex labeling and routing in expanded Apollonian networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Vertex labeling and routing in expanded Apollonian networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vertex labeling and routing in expanded Apollonian networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-47713