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

DOI10.1016/j.physa.2015.12.089zbMath1400.05220OpenAlexW2222123355MaRDI 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 networkscale-freesmall-worldnon-fractal scalingSierpinski pentagon

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Fractals (28A80)

Related Items (18)

Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk ⋮ ANALYSES OF SOME STRUCTURAL PROPERTIES ON A CLASS OF HIERARCHICAL SCALE-FREE NETWORKS ⋮ AVERAGE TRAPPING TIME OF HONEYPOTS ON WEIGHTED RANDOM FRACTAL NETWORKS ⋮ Information spreading in complex networks with participation of independent spreaders ⋮ A family of small-world network models built by complete graph and iteration-function ⋮ Dynamical processes and epidemic threshold on nonlinear coupled multiplex networks ⋮ A key heterogeneous structure of fractal networks based on inverse renormalization scheme ⋮ An information dimension of weighted complex networks ⋮ Eigentime identities of fractal sailboat networks ⋮ Eigentime identities of potting networks ⋮ TWO-POINT RESISTANCES IN SAILBOAT FRACTAL NETWORKS ⋮ ASYMPTOTIC FORMULA ON AVERAGE PATH LENGTH OF A SPECIAL NETWORK BASED ON SIERPINSKI CARPET ⋮ SMALL-WORLD AND SCALE-FREE PROPERTIES OF FRACTAL NETWORKS MODELED ON n-DIMENSIONAL SIERPINSKI PYRAMID ⋮ Resistance distance in potting networks ⋮ A directed weighted scale-free network model with an adaptive evolution mechanism ⋮ Fractal networks with Sturmian structure ⋮ COMPLEX NETWORKS MODELED ON A KIND OF SIERPIŃSKI-LIKE CARPET ⋮ FRACTAL NETWORKS ON DÜRER-TYPE POLYGON

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

This page was built for publication: A small-world and scale-free network generated by Sierpinski pentagon