Abstract

Abstract In this paper, we study a hierarchical scale-free network with special fractal structure. We study the average path length and associate the average path length with the symbol length. Then using a recursive method, we obtain the asymptotic formula for average path length of our networks.

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 call

Similar Papers

Paper Title
Journal
Date
Author

More From: Chaos, Solitons & Fractals

Paper Title
Journal
Date
Author

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.