Farey Graphs as Models for Complex Networks

Details Farey Graphs as Models for Complex Networks Farey Graphs as Models for Complex Networks

2011-05-03

arxiv.org/abs/1105.0575v1

Theoretical Computer Science 412 (2011) 865--875

Physics

Condensed Matter

Statistical Mechanics

Definitive version published in Theoretical Computer Science

Scientific paper

10.1016/j.tcs.2010.11.036

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.

Affiliated with

Also associated with

No associations

Rating

Farey Graphs as Models for Complex Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Farey Graphs as Models for Complex Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Farey Graphs as Models for Complex Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-693760