Processing math: 100%
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

THE SCALE-FREE AND SMALL-WORLD PROPERTIES OF COMPLEX NETWORKS ON SIERPINSKI-TYPE HEXAGON

    https://doi.org/10.1142/S0218348X20500541Cited by:13 (Source: Crossref)

    In this paper, a network is generated from a Sierpinski-type hexagon by applying the encoding method in fractal. The criterion of neighbor is established to quantify the relationships among the nodes in the network. Based on the self-similar structures, we verify the scale-free and small-world effects. The power-law exponent on degree distribution is derived to be log26 and the average clustering coefficients are shown to be larger than 0.4255. Moreover, we give the bounds of the average path length of our proposed network from the renewal theorem and self-similarity.