Deterministic self-similar models of complex networks based on very symmetric graphs

DOI10.1016/J.PHYSA.2013.06.001zbMath1395.05159OpenAlexW1994264599MaRDI QIDQ1673212

Martin Knor, Riste Škrekovski

Publication date: 11 September 2018

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

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

zbMATH Keywords

complex systemsscale-free networksmall world networkdeterministic model

Mathematics Subject Classification ID

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

Related Items (4)

Complex networks modeled on the Sierpinski gasket ⋮ A small-world and scale-free network generated by Sierpinski pentagon ⋮ A key heterogeneous structure of fractal networks based on inverse renormalization scheme ⋮ SMALL-WORLD AND SCALE-FREE PROPERTIES OF FRACTAL NETWORKS MODELED ON n-DIMENSIONAL SIERPINSKI PYRAMID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Farey graphs as models for complex networks
• Incompatibility networks as models of scale-free small-world graphs
• Recursive weighted treelike networks
• Triangulations of orientable surfaces by complete tripartite graphs
• Emergence of Scaling in Random Networks
• Deterministic hierarchical networks
• Self-similar non-clustered planar graphs as models for complex networks
• The Structure and Function of Complex Networks
• Evolving small-world networks with geographical attachment preference
• Collective dynamics of ‘small-world’ networks
• Deterministic scale-free networks

This page was built for publication: Deterministic self-similar models of complex networks based on very symmetric graphs