COMPLEX NETWORKS MODELED ON A KIND OF SIERPIŃSKI-LIKE CARPET
From MaRDI portal
Publication:5864143
DOI10.1142/S0218348X22500591zbMath1490.90083OpenAlexW4206041239MaRDI QIDQ5864143
Publication date: 3 June 2022
Published in: Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218348x22500591
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10)
Related Items (1)
Cites Work
- Unnamed Item
- Asymptotic formula on average path length of fractal networks modeled on Sierpinski gasket
- Evolution of the social network of scientific collaborations
- Complex networks modeled on the Sierpinski gasket
- A small-world and scale-free network generated by Sierpinski pentagon
- Scale-free and small-world properties of Sierpinski networks
- Complex networks: structure and dynamics
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- The exact solution of the mean geodesic distance for Vicsek fractals
- A box-covering algorithm for fractal scaling in scale-free networks
- The Structure and Function of Complex Networks
- ASYMPTOTIC FORMULA ON AVERAGE PATH LENGTH OF A SPECIAL NETWORK BASED ON SIERPINSKI CARPET
- SMALL-WORLD AND SCALE-FREE PROPERTIES OF THE n-DIMENSIONAL SIERPINSKI CUBE NETWORKS
- THE SCALE-FREE AND SMALL-WORLD PROPERTIES OF COMPLEX NETWORKS ON SIERPINSKI-TYPE HEXAGON
- Collective dynamics of ‘small-world’ networks
- A SMALL-WORLD AND SCALE-FREE NETWORK GENERATED BY SIERPINSKI TETRAHEDRON
This page was built for publication: COMPLEX NETWORKS MODELED ON A KIND OF SIERPIŃSKI-LIKE CARPET