Abstract

In this paper, we present the weighted iterated friendship graphs and study the trapping problem on the weighted iterated friendship graphs. It can be found that for [Formula: see text] and [Formula: see text], the relationship between the average trapping time (ATT) and network size is sublinear and linear, respectively. By controlling the parameters of the weighted iterated friendship graphs, the models are changed to the self-similar weighted networks. The average shortest weighted path (ASWP) in the self-similar weighted friendship graphs is studied. The results show that when [Formula: see text], the ASWP is bounded, and when [Formula: see text], the ASWP is linearly related to the order of the 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: 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.