A family of small-world network models built by complete graph and iteration-function
From MaRDI portal
Publication:2148313
DOI10.1016/j.physa.2017.11.136OpenAlexW2770759691MaRDI QIDQ2148313
Publication date: 23 June 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2017.11.136
hierarchical structurenetwork modelsnumber of spanning treesnetwork spacesmall-world propertyexponential-scale feature
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Farey graphs as models for complex networks
- Complex networks modeled on the Sierpinski gasket
- A small-world and scale-free network generated by Sierpinski pentagon
- Scale-free and small-world properties of Sierpinski networks
- The number of spanning trees in Apollonian networks
- Collective dynamics of ‘small-world’ networks
- The average distances in random graphs with given expected degrees
- Deterministic scale-free networks
This page was built for publication: A family of small-world network models built by complete graph and iteration-function