arXiv · cond-mat/0512143
Deterministic scale-free networks created in a recursive manner
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Zhongzhi Zhang, Lili Rong. 2005-12-07. Deterministic scale-free networks created in a recursive manner. https://doi.org/10.1109/icccas.2006.285223
Cite the original work for its findings. Save a collection to share your selection of sources.