Related Experiment Video
Updated: Mar 21, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Label-based routing for a family of small-world Farey graphs
Yinhu Zhai1,2, Yinhe Wang2
1School of Information Engineering, Guangdong University of Technology, Guangzhou, 510006, China.
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.
Related Concept Videos
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Bewley Lattice Diagram
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Short-distance Transport of Resources
Kirchoff's Rules: Application
When applying Kirchhoff's first rule, the junction rule, label the current in each branch and decide its direction. If the chosen direction is wrong, it will have the correct magnitude, although the...
Graphs of Functions

