title: Label-based routing for a family of small-world Farey graphs.
abstract: We introduce an informative labelling method for vertices in a family of Farey graphs, and deduce a routing algorithm on all the shortest paths between any two vertices in Farey graphs. The label of a vertex is composed of the precise locating position in graphs and the exact time linking to graphs. All the shortest paths routing between any pair of vertices, which number is exactly the product of two Fibonacci numbers, are determined only by their labels, and the time complexity of the algorithm is O(n). It is the first algorithm to figure out all the shortest paths between any pair of vertices in a kind of deterministic graphs. For Farey networks, the existence of an efficient routing protocol is of interest to design practical communication algorithms in relation to dynamical processes (including synchronization and structural controllability) and also to understand the underlying mechanisms that have shaped their particular structure.
authors.affiliation: School of Information Engineering, Guangdong University of Technology, Guangzhou, 510006, China.|School of Automation, Guangdong University of Technology, Guangzhou, 510006, China.
authors.forename: Yinhu
authors.initials: Y
authors.lastname: Zhai
authors.affiliation: School of Automation, Guangdong University of Technology, Guangzhou, 510006, China.
authors.forename: Yinhe
authors.initials: Y
authors.lastname: Wang