Abstract
Small-world is a common property existing in many reallife social, technological and biological networks. Small-world networks distinguish themselves from others by their high clustering coefficient and short average path length. In the past dozen years, many probabilistic small-world networks and some deterministic small-world networks have been proposed utilizing various mechanisms. In this Letter, we propose a new deterministic small-world network model by first constructing a binary-tree structure and then adding links between each pair of brother nodes and links between each grandfather node and its four grandson nodes. Furthermore, we give the analytic solutions to several topological characteristics, which shows that the proposed model is a small-world network.
| Original language | English |
|---|---|
| Pages (from-to) | 1536-1538 |
| Number of pages | 3 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E95-D |
| Issue number | 5 |
| DOIs | |
| State | Published - May 2012 |
| Externally published | Yes |
Keywords
- Average path length
- Clustering coefficient
- Deterministic small-world models
- Interconnection network
- Tree-structured network
Fingerprint
Dive into the research topics of 'A tree-structured deterministic small-world network'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver