Recursive graphs with small-world scale-free properties

Abstract

We discuss a category of graphs, recursive clique trees, which have small-world and scale-free properties and allow a fine tuning of the clustering and the power-law exponent of their discrete degree distribution. We determine relevant characteristics of those graphs: the diameter, degree distribution, and clustering parameter. The graphs have also an interesting recursive property, and generalize recent constructions with fixed degree distributions.

4 pages, 2 figures

Cited by in corpus (4)

• Self-similar disk packings as model spatial scale-free networks
• A deterministic small-world network created by edge iterations
• Characterizing the network topology of the energy landscapes of atomic clusters
• Minimal models of weighted scale-free networks