Abstract
In this paper, we present weighted tetrahedron Koch networks depending on a weight factor. According to their self-similar construction, we obtain the analytical expressions of the weighted clustering coefficient and average weighted shortest path (AWSP). The obtained solutions show that the weighted tetrahedron Koch networks exhibits small-world property. Then, we calculate the average receiving time (ART) on weighted-dependent walks, which is the sum of mean first-passage times (MFPTs) for all nodes absorpt at the trap located at a hub node. We find that the ART exhibits a sublinear or linear dependence on network order.
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.
