AVERAGE GEODESIC DISTANCE OF NODE-WEIGHTED SIERPINSKI NETWORKS

DOI10.1142/S0218348X1950110XzbMath1434.28039OpenAlexW2953796443WikidataQ127592491 ScholiaQ127592491MaRDI QIDQ5108644

Li-Feng Xi, Qianqian Ye, Jiangwen Gu

Publication date: 5 May 2020

Published in: Fractals (Search for Journal in Brave)

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

zbMATH Keywords

self-similar measureaverage distancefractal networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Fractals (28A80) Distance in graphs (05C12)

Related Items

Scaling of average receiving time and average weighted shortest path on weighted-crystal network, Mean geodesic distance of the level-\(n\) Sierpinski gasket, Weighted average geodesic distance of Vicsek network in three-dimensional space, AVERAGE FERMAT DISTANCE OF A FRACTAL TREE

Cites Work

• Unnamed Item
• Unnamed Item
• On the eccentric distance sum of graphs
• Stochastic completeness for graphs with curvature dimension conditions
• Asymptotic formula on average path length of fractal networks modeled on Sierpinski gasket
• On-diagonal lower estimate of heat kernels on graphs
• Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks
• The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network
• On the minimum eccentric distance sum of bipartite graphs with some given parameters
• Computing the eccentric-distance sum for graph operations
• AVERAGE GEODESIC DISTANCE OF SIERPINSKI GASKET AND SIERPINSKI NETWORKS
• ASYMPTOTIC FORMULA OF ECCENTRIC DISTANCE SUM FOR VICSEK NETWORK
• ECCENTRIC DISTANCE SUM OF SIERPIŃSKI GASKET AND SIERPIŃSKI NETWORK
• AVERAGE GEODESIC DISTANCE OF SIERPINSKI CARPET
• Collective dynamics of ‘small-world’ networks