AVERAGE FERMAT DISTANCE OF A PSEUDO-FRACTAL HIERARCHICAL SCALE-FREE NETWORK
From MaRDI portal
Publication:6100821
DOI10.1142/s0218348x23500135zbMath1517.05163MaRDI QIDQ6100821
Di-Rong Chen, Yu-Mei Xue, Unnamed Author, Zixuan Zhao, Cheng Zeng
Publication date: 22 June 2023
Published in: Fractals (Search for Journal in Brave)
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Fractals (28A80) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Asymptotic formula on average path length of fractal networks modeled on Sierpinski gasket
- Geometric methods and optimization problems
- Steiner intervals in graphs
- Average geodesic distance of skeleton networks of Sierpinski tetrahedron
- Asymptotic formula on average path length in a hierarchical scale-free network with fractal structure
- Emergence of Scaling in Random Networks
- Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks
- SCALE-FREE AND SMALL-WORLD PROPERTIES OF A SPECIAL HIERARCHICAL NETWORK
- FRACTAL NETWORKS ON DÜRER-TYPE POLYGON
- AVERAGE DISTANCES OF LINDSTRÖM SNOWFLAKE NETWORKS
- AVERAGE FERMAT DISTANCE OF A FRACTAL TREE
- AVERAGE FERMAT DISTANCES ON VICSEK NETWORKS
- FRACTAL NETWORKS ON SIERPINSKI-TYPE POLYGON
- AVERAGE DISTANCE OF SELF-SIMILAR FRACTAL TREES
- Collective dynamics of ‘small-world’ networks
- Deterministic scale-free networks
This page was built for publication: AVERAGE FERMAT DISTANCE OF A PSEUDO-FRACTAL HIERARCHICAL SCALE-FREE NETWORK