Abstract
In the past dozen years, many probabilistic small-world networks and some deterministic smallworld networks have been proposed utilizing various mechanisms. Recently, Guo et al. [1] proposed a deterministic small-world network model by first constructing a binary-tree structure from star K1,2 by adding some edges in each iteration with a simple mechanism. In this paper, we propose a new deterministic small-world network model by constructing a binary-tree structure from a star K1,6 and then adding links between each grandfather node and its four grandson nodes for each tree in each iteration. Furthermore, we give the analytic solution to several topological characteristics, which shows that the proposed model is a small-world network.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
