Average distances on substitution trees
From MaRDI portal
Publication:2162089
DOI10.1016/j.physa.2019.121556OpenAlexW2945122309MaRDI QIDQ2162089
Publication date: 5 August 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2019.121556
Related Items (7)
AVERAGE FERMAT DISTANCES OF TWO-COLORED SUBSTITUTION NETWORKS ⋮ ECCENTRIC STEINER DISTANCE SUM OF VICSEK NETWORKS ⋮ ARITHMETIC ON MORAN SETS ⋮ On the scale-freeness of random colored substitution networks ⋮ Graph concatenations to derive weighted fractal networks ⋮ THE AVERAGE WEIGHTED PATH LENGTH FOR A CLASS OF HIERARCHICAL NETWORKS ⋮ WEIGHTED AVERAGE GEODESIC DISTANCE OF PENTADENDRITE NETWORKS
Cites Work
- Unnamed Item
- Unnamed Item
- Comment on: ``Any \(l\)-state solutions of the Klein-Gordon equation with the generalized Hulthén potential
- Stochastic completeness for graphs with curvature dimension conditions
- Scale-free and small-world properties of Sierpinski networks
- Multifractal analysis and topological properties of a new family of weighted Koch networks
- Scale-free effect of substitution networks
- Average geodesic distance of skeleton networks of Sierpinski tetrahedron
- AVERAGE GEODESIC DISTANCE OF SIERPINSKI GASKET AND SIERPINSKI NETWORKS
- AVERAGE GEODESIC DISTANCE OF SIERPINSKI CARPET
- AVERAGE DISTANCE OF SELF-SIMILAR FRACTAL TREES
- Collective dynamics of ‘small-world’ networks
This page was built for publication: Average distances on substitution trees