Simplex triangulation induced scale-free networks

zbMATH Open1098.05074MaRDI QIDQ5486035FDOQ5486035

Authors: Zhi-Ming Gu, Tao Zhou, Gang Yan, Chen-Ping Zhu, Zhongqian Fu, Bing-Hong Wang 

Publication date: 6 September 2006

Full work available at URL: https://arxiv.org/abs/cond-mat/0505175

Recommendations

• A small-world and scale-free network generated by Sierpinski tetrahedron
• Sierpinski networks with scale-free topology and small-world effect
• Complex scale-free networks with tunable power-law exponent and clustering
• The scale-free and small-world properties of complex networks on Sierpinski-type hexagon
• High-dimensional Apollonian networks

zbMATH Keywords

clustering coefficientssimplex triangulation networkssmall average distances

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (3)

• Self-similar non-clustered planar graphs as models for complex networks
• The phases of large networks with edge and triangle constraints
• Scale free properties of random \(k\)-trees

This page was built for publication: Simplex triangulation induced scale-free networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5486035)