2008/06/07 by Lichao Chen, Chen, Lichao, Francesc Comellas +3
Computer Science · Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #FOS: Physical sciences #Graph theory and applications #Physics and Society (physics.soc-ph) #Statistical Mechanics (cond-mat.stat-mech) #Topological and Geometric Data Analysis #cond-mat.stat-mech #physics.soc-ph
paper · pdf · doi:10.48550/arxiv.0806.1258
10 pages, submitted to 19th International Workshop on Combinatorial Algorithms (IWOCA 2008)
arxiv created 2008/06/07 · openalex publication_date 2008/06/07 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we introduce a family of planar, modular and self-similar graphs which have small-world and scale-free properties. The main parameters of this family are comparable to those of networks associated to complex systems, and therefore the graphs are of interest as mathematical models for these systems. As the clustering coefficient of the graphs is zero, this family is an explicit construction that does not match the usual characterization of hierarchical modular networks, namely that vertices have clustering values inversely proportional to their degrees.