AVERAGE FERMAT DISTANCE OF A FRACTAL TREE

DOI10.1142/S0218348X21502121zbMath1493.28014OpenAlexW3180251696MaRDI QIDQ5025350

Li-Feng Xi, Chen Chen, Ying Ma

Publication date: 1 February 2022

Published in: Fractals (Search for Journal in Brave)

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

zbMATH Keywords

fractalself-similar fractalfinite patternaverage Fermat distance

Mathematics Subject Classification ID

Fractals (28A80) General theory of distance geometry (51K05)

Related Items (4)

AVERAGE FERMAT DISTANCES OF TWO-COLORED SUBSTITUTION NETWORKS ⋮ ECCENTRIC STEINER DISTANCE SUM OF VICSEK NETWORKS ⋮ AVERAGE FERMAT DISTANCE OF A PSEUDO-FRACTAL HIERARCHICAL SCALE-FREE NETWORK ⋮ FRACTAL VERSION OF ZAGREB ECCENTRICITY INDEX

Cites Work

• Unnamed Item
• The average distance on the Sierpiński gasket
• Geometric methods and optimization problems
• 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
• AVERAGE GEODESIC DISTANCE OF SIERPINSKI GASKET AND SIERPINSKI NETWORKS
• Weighted average geodesic distance of Vicsek network in three-dimensional space
• AVERAGE DISTANCES OF LINDSTRÖM SNOWFLAKE NETWORKS
• AVERAGE GEODESIC DISTANCE ON SIERPINSKI HEXAGON AND SIERPINSKI HEXAGON NETWORKS
• AVERAGE GEODESIC DISTANCE OF NODE-WEIGHTED SIERPINSKI NETWORKS
• 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
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata

This page was built for publication: AVERAGE FERMAT DISTANCE OF A FRACTAL TREE