Average Fermat distance of a self-similar fractal tree
From MaRDI portal
Publication:5086259
DOI10.1142/S0218348X22500761OpenAlexW4214521712MaRDI QIDQ5086259FDOQ5086259
Authors: Ying Ma, Chen Chen, Lifeng Xi
Publication date: 5 July 2022
Published in: Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218348x22500761
Recommendations
Cites Work
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- Collective dynamics of `small-world' networks
- Networks. An introduction.
- Title not available (Why is that?)
- Title not available (Why is that?)
- HAUSDORFF DIMENSION OF SELF-SIMILAR SETS WITH OVERLAPS
- Geometric methods and optimization problems
- A generalized finite type condition for iterated function systems
- FRACTAL NETWORKS ON SIERPINSKI-TYPE POLYGON
- Average geodesic distance of Sierpinski gasket and Sierpinski networks
- Asymptotic formula on average path length in a hierarchical scale-free network with fractal structure
- Weighted average geodesic distance of Vicsek network
- Average geodesic distance on Sierpinski hexagon and Sierpinski hexagon networks
- Asymptotic formula of average distances on fractal networks modeled by Sierpinski tetrahedron
- THE AVERAGE WEIGHTED PATH LENGTH FOR A CLASS OF HIERARCHICAL NETWORKS
- Average distance of self-similar fractal trees
- Two-point resistances in sailboat fractal networks
- Weighted average geodesic distance of Vicsek network in three-dimensional space
Cited In (5)
This page was built for publication: Average Fermat distance of a self-similar fractal tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5086259)