FRACTAL NETWORKS ON SIERPINSKI-TYPE POLYGON

DOI10.1142/S0218348X20500875zbMath1445.28019OpenAlexW3010690620MaRDI QIDQ5129911

Cheng Zeng, Yu-Mei Xue, Meng Zhou

Publication date: 3 November 2020

Published in: Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218348x20500875

zbMATH Keywords

self-similaritycomplex networksscale-freesmall-worldSierpinski-type polygon

Mathematics Subject Classification ID

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

Related Items (11)

FRACTAL NETWORKS MODELED BY SOME FRACTAL CARPET ⋮ Average geodesic distance on stretched Sierpiński gasket ⋮ NODE-WEIGHTED AVERAGE FERMAT DISTANCES OF FRACTAL TREE NETWORKS ⋮ AVERAGE FERMAT DISTANCES ON VICSEK NETWORKS ⋮ MEAN STEINER DISTANCE OF VICSEK NETWORKS ⋮ AVERAGE FERMAT DISTANCE OF A SELF-SIMILAR FRACTAL TREE ⋮ AVERAGE GEODESIC DISTANCE OF SIERPIŃSKI-TYPE NETWORKS ⋮ AVERAGE FERMAT DISTANCE OF A PSEUDO-FRACTAL HIERARCHICAL SCALE-FREE NETWORK ⋮ FRACTAL NETWORKS ON DÜRER-TYPE POLYGON ⋮ MEAN DISTANCE ON STRETCHED CANTOR PRODUCT ⋮ AVERAGE FERMAT DISTANCE OF A FRACTAL TREE

Cites Work

• Complex networks modeled on the Sierpinski gasket
• Scale-free and small-world properties of Sierpinski networks
• Average geodesic distance of skeleton networks of Sierpinski tetrahedron
• Generating hierarchial scale-free graphs from fractals
• Emergence of Scaling in Random Networks
• AVERAGE GEODESIC DISTANCE OF SIERPINSKI CARPET
• Collective dynamics of ‘small-world’ networks
• Deterministic scale-free networks

This page was built for publication: FRACTAL NETWORKS ON SIERPINSKI-TYPE POLYGON