Vertex labeling and routing for Farey-type symmetrically-structured graphs (Q2333775): Difference between revisions

Summary: The generalization of Farey graphs and extended Farey graphs all originate from Farey graphs. They are simultaneously scale-free and small-world. A labeling of the vertices for them are proposed here. All of the shortest paths between any two vertices in these two graphs can be determined only on their labels. The number of shortest paths between any two vertices is the product of two Fibonacci numbers; it is increasing almost linearly with the order or size of the graphs. However, the label-based routing algorithm runs in logarithmic time \(O(\log n)\). Our efficient routing protocol for Farey-type models should help contribute toward the understanding of several physical dynamic processes.