Average Fermat distance of a self-similar fractal tree
From MaRDI portal
Publication:5086259
Recommendations
Cites work
- scientific article; zbMATH DE number 3964277 (Why is no real title available?)
- scientific article; zbMATH DE number 44693 (Why is no real title available?)
- A generalized finite type condition for iterated function systems
- Asymptotic formula of average distances on fractal networks modeled by Sierpinski tetrahedron
- Asymptotic formula on average path length in a hierarchical scale-free network with fractal structure
- Average distance of self-similar fractal trees
- Average geodesic distance of Sierpinski gasket and Sierpinski networks
- Average geodesic distance on Sierpinski hexagon and Sierpinski hexagon networks
- Collective dynamics of `small-world' networks
- Emergence of Scaling in Random Networks
- FRACTAL NETWORKS ON SIERPINSKI-TYPE POLYGON
- Geometric methods and optimization problems
- HAUSDORFF DIMENSION OF SELF-SIMILAR SETS WITH OVERLAPS
- Networks. An introduction.
- THE AVERAGE WEIGHTED PATH LENGTH FOR A CLASS OF HIERARCHICAL NETWORKS
- The Structure and Function of Complex Networks
- Two-point resistances in sailboat fractal networks
- Weighted average geodesic distance of Vicsek network
- 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)