Next Article in Journal
BGPcoin: Blockchain-Based Internet Number Resource Authority and BGP Security Solution
Next Article in Special Issue
Evolutionary Hierarchical Sparse Extreme Learning Autoencoder Network for Object Recognition
Previous Article in Journal
Limits of it-Soft Sets and Their Applications for Rough Sets
Previous Article in Special Issue
Effective Blind Frequency Offset Estimation Scheme for BST-OFDM Based HDTV Broadcast Systems
Article Menu
Issue 9 (September) cover image

Export Article

Open AccessArticle
Symmetry 2018, 10(9), 407; https://doi.org/10.3390/sym10090407

Vertex Labeling and Routing for Farey-Type Symmetrically-Structured Graphs

1
School of Computer, Guangdong University of Technology, Guangzhou 510006, China
2
School of Information Engineering, Guangdong University of Technology, Guangzhou 510006, China
3
System and Network Engineering Research Group, Informatics Institute, University of Amsterdam, Science Park 904, 1098XH Amsterdam, The Netherlands
4
School of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, China
*
Author to whom correspondence should be addressed.
Received: 31 July 2018 / Revised: 13 September 2018 / Accepted: 15 September 2018 / Published: 17 September 2018
(This article belongs to the Special Issue Symmetry in Computing Theory and Application)
Full-Text   |   PDF [4237 KB, uploaded 18 September 2018]   |  

Abstract

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(logn). Our efficient routing protocol for Farey-type models should help contribute toward the understanding of several physical dynamic processes. View Full-Text
Keywords: complex networks; deterministic models; Farey-type graphs; vertex labeling; shortest path routing complex networks; deterministic models; Farey-type graphs; vertex labeling; shortest path routing
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Jiang, W.; Zhai, Y.; Zhuang, Z.; Martin, P.; Zhao, Z.; Liu, J.-B. Vertex Labeling and Routing for Farey-Type Symmetrically-Structured Graphs. Symmetry 2018, 10, 407.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top