Deterministic scale-free networks created in a recursive manner
arXiv:cond-mat/0512143 · doi:10.1109/ICCCAS.2006.285223
Abstract
In a recursive way and by including a parameter, we introduce a family of deterministic scale-free networks. The resulting networks exhibit small-world effects. We calculate the exact results for the degree exponent, the clustering coefficient and the diameter. The major points of our results indicate: the degree exponent can be adjusted; the clustering coefficient of each individual vertex is inversely proportional to its degree and the average clustering coefficient of all vertices approaches to a nonzero value in the infinite network order; and the diameter grows logarithmically with the number of network vertices.
5 pages, 2 figures
References in corpus (12)
- The structure and function of complex networks
- Maximal planar networks with large clustering coefficient and power-law degree distribution
- Self-similar disk packings as model spatial scale-free networks
- A deterministic small-world network created by edge iterations
- Recursive graphs with small-world scale-free properties
- High dimensional random Apollonian networks
- High Dimensional Apollonian Networks
- Evolving Apollonian Networks with Small-world Scale-free topologies
- Evolving small-world networks with geographical attachment preference
- Exactly solvable scale-free network model
- Integer Networks
- Flexible construction of hierarchical scale-free networks with general exponent