ECCENTRIC STEINER DISTANCE SUM OF VICSEK NETWORKS
From MaRDI portal
Publication:5046642
DOI10.1142/S0218348X22501298zbMath1503.05034OpenAlexW4288722639MaRDI QIDQ5046642
Wenjia Ma, Lei Lei, Qi Jia, Li-Feng Xi
Publication date: 9 November 2022
Published in: Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218348x22501298
Fractals (28A80) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Related Items (1)
Cites Work
- Unnamed Item
- Multifractal analysis and topological properties of a new family of weighted Koch networks
- Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
- Multiplicative version of eccentric connectivity index
- Weighted average geodesic distance of Vicsek network
- Average distances on substitution trees
- Asymptotic formula on average path length in a hierarchical scale-free network with fractal structure
- Emergence of Scaling in Random Networks
- The exact solution of the mean geodesic distance for Vicsek fractals
- AVERAGE GEODESIC DISTANCE OF SIERPINSKI GASKET AND SIERPINSKI NETWORKS
- ASYMPTOTIC FORMULA OF ECCENTRIC DISTANCE SUM FOR VICSEK NETWORK
- ECCENTRIC DISTANCE SUM OF SIERPIŃSKI GASKET AND SIERPIŃSKI NETWORK
- AVERAGE FERMAT DISTANCE OF A FRACTAL TREE
- AVERAGE FERMAT DISTANCES ON VICSEK NETWORKS
- MEAN STEINER DISTANCE OF VICSEK NETWORKS
- AVERAGE DISTANCE OF SUBSTITUTION NETWORKS
- ASYMPTOTIC FORMULA OF AVERAGE DISTANCES ON FRACTAL NETWORKS MODELED BY SIERPINSKI TETRAHEDRON
- THE AVERAGE WEIGHTED PATH LENGTH FOR A CLASS OF HIERARCHICAL NETWORKS
- Collective dynamics of ‘small-world’ networks
- The steiner problem in graphs
This page was built for publication: ECCENTRIC STEINER DISTANCE SUM OF VICSEK NETWORKS
