A small-world and scale-free network generated by Sierpinski pentagon

DOI10.1016/j.physa.2015.12.089zbMath1400.05220MaRDI QIDQ1619252

Jin Chen, Qin Wang, Anbo Le, Li-Feng Xi

Publication date: 13 November 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2015.12.089

zbMATH Keywords

complex network; scale-free; small-world; non-fractal scaling; Sierpinski pentagon

Mathematics Subject Classification ID

05C82: Small world graphs, complex networks (graph-theoretic aspects)

28A80: Fractals

Related Items

ASYMPTOTIC FORMULA ON AVERAGE PATH LENGTH OF A SPECIAL NETWORK BASED ON SIERPINSKI CARPET, TWO-POINT RESISTANCES IN SAILBOAT FRACTAL NETWORKS, SMALL-WORLD AND SCALE-FREE PROPERTIES OF FRACTAL NETWORKS MODELED ON n-DIMENSIONAL SIERPINSKI PYRAMID, Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic formula on average path length of fractal networks modeled on Sierpinski gasket
• Complex networks modeled on the Sierpinski gasket
• Deterministic self-similar models of complex networks based on very symmetric graphs
• Emergence of Scaling in Random Networks
• DEFINING DIMENSION OF A COMPLEX NETWORK
• The exact solution of the mean geodesic distance for Vicsek fractals
• A box-covering algorithm for fractal scaling in scale-free networks
• Collective dynamics of ‘small-world’ networks
• Fractality and the small-world effect in Sierpinski graphs