NODE-WEIGHTED AVERAGE FERMAT DISTANCES OF FRACTAL TREE NETWORKS

DOI10.1142/S0218348X22500256zbMath1495.28008OpenAlexW4200419191MaRDI QIDQ5064331

Li-Feng Xi, Chen Chen, Ying Ma

Publication date: 15 March 2022

Published in: Fractals (Search for Journal in Brave)

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

zbMATH Keywords

self-similar fractalfinite patternaverage Fermat distance

Mathematics Subject Classification ID

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

Related Items (1)

AVERAGE FERMAT DISTANCES OF TWO-COLORED SUBSTITUTION NETWORKS

Cites Work

• Unnamed Item
• A generalized finite type condition for iterated function systems
• Geometric methods and optimization problems
• Scale-free and small-world properties of Sierpinski networks
• Average geodesic distance of skeleton networks of Sierpinski tetrahedron
• Weighted average geodesic distance of Vicsek network
• Asymptotic formula on average path length in a hierarchical scale-free network with fractal structure
• Emergence of Scaling in Random Networks
• HAUSDORFF DIMENSION OF SELF-SIMILAR SETS WITH OVERLAPS
• The Structure and Function of Complex Networks
• AVERAGE GEODESIC DISTANCE OF SIERPINSKI GASKET AND SIERPINSKI NETWORKS
• Weighted average geodesic distance of Vicsek network in three-dimensional space
• ASYMPTOTIC FORMULA OF AVERAGE DISTANCES ON FRACTAL NETWORKS MODELED BY SIERPINSKI TETRAHEDRON
• THE AVERAGE WEIGHTED PATH LENGTH FOR A CLASS OF HIERARCHICAL NETWORKS
• FRACTAL NETWORKS ON SIERPINSKI-TYPE POLYGON
• Collective dynamics of ‘small-world’ networks

This page was built for publication: NODE-WEIGHTED AVERAGE FERMAT DISTANCES OF FRACTAL TREE NETWORKS