NODE-WEIGHTED AVERAGE DISTANCES OF NETWORKS MODELED ON THREE-DIMENSIONAL VICSEK FRACTAL

DOI10.1142/S0218348X21500948zbMath1490.28009OpenAlexW3114421428MaRDI QIDQ5023966

Ying Ma, Li-Feng Xi, Qi Jia, Lei Lei, Chen Chen, Yuan-Yuan Li

Publication date: 28 January 2022

Published in: Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218348x21500948

zbMATH Keywords

self-similar measurefractal networkaverage geodesic distance

Mathematics Subject Classification ID

Fractals (28A80)

Related Items (1)

Scaling of average receiving time and average weighted shortest path on weighted-crystal network

Cites Work

• Unnamed Item
• Unnamed Item
• Stochastic completeness for graphs with curvature dimension conditions
• Complex networks modeled on the Sierpinski gasket
• Weighted average geodesic distance of Vicsek network
• Li-Yau inequality for unbounded Laplacian on graphs
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• CHARACTERISTIC POLYNOMIAL OF ADJACENCY OR LAPLACIAN MATRIX FOR WEIGHTED TREELIKE NETWORKS
• Collective dynamics of ‘small-world’ networks
• Networks

This page was built for publication: NODE-WEIGHTED AVERAGE DISTANCES OF NETWORKS MODELED ON THREE-DIMENSIONAL VICSEK FRACTAL