Skip to main content
Article thumbnail
Location of Repository

Farey Graphs as Models for Complex Networks

By Zhongzhi Zhang and Francesc Comellas

Abstract

Farey sequences of irreducible fractions between 0 and 1 can be related to graph constructions known as Farey graphs. These graphs were first introduced by Matula and Kornerup in 1979 and further studied by Colbourn in 1982 and they have many interesting properties: they are minimally 3-colorable, uniquely Hamiltonian, maximally outerplanar and perfect. In this paper we introduce a simple generation method for a Farey graph family, and we study analytically relevant topological properties: order, size, degree distribution and correlation, clustering, transitivity, diameter and average distance. We show that the graphs are a good model for networks associated with some complex systems.Comment: Definitive version published in Theoretical Computer Scienc

Topics: Condensed Matter - Statistical Mechanics
Year: 2015
DOI identifier: 10.1016/j.tcs.2010.11.036
OAI identifier: oai:arXiv.org:1105.0575
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1105.0575 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.