Abstract
As the deterministic version of the uniform recursive tree (URT), the deterministic uniform recursive tree (DURT) has been intensively studied by Zhang et al. (2008) [21]. They gave several important properties of DURT, including its topological characteristics and spectral properties. Although DURT shows a logarithmic scaling with the size of the network, DURT is not a small-world network since its clustering coefficient is zero. In this paper, we propose a new deterministic small-world network by adding some edges with a simple rule in each DURT iteration, and then give the analytic solutions to several topological characteristics of the model proposed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.