Abstract
Farey graphs are simultaneously small-world, uniquely Hamiltonian, minimally 3-colorable, maximally outerplanar and perfect. Farey graphs are therefore famous in deterministic models for complex networks. By lacking of the most important characteristics of scale-free, Farey graphs are not a good model for networks associated with some empirical complex systems. We discuss here a category of graphs which are extension of the well-known Farey graphs. These new models are named generalized Farey graphs here. We focus on the analysis of the topological characteristics of the new models and deduce the complicated and graceful analytical results from the growth mechanism used in generalized Farey graphs. The conclusions show that the new models not only possess the properties of being small-world and highly clustered, but also possess the quality of being scale-free. We also find that it is precisely because of the exponential increase of nodes' degrees in generalized Farey graphs as they grow that caused the new networks to have scale-free characteristics. In contrast, the linear incrementation of nodes' degrees in Farey graphs can only cause an exponential degree distribution.