Comellas, Francesc; Zhang, Zhongzhi; Chen, Lichao Self-similar non-clustered planar graphs as models for complex networks. (English) Zbl 1165.05025 J. Phys. A, Math. Theor. 42, No. 4, Article ID 045103, 10 p. (2009). This paper deals with planar, modular and self-similar graphs which have small-world and scale-free properties. Modularity and scale-free properties are present in many real networks like the ones associated with living organisms, some of the social networks and also technical networks. The model described in the paper, with a null clustering coefficient, can be used to study properties of such networks without the influence of clustering. Reviewer: Viorel Mihai Gontineac (Iaşi) Cited in 1 Document MSC: 05C85 Graph algorithms (graph-theoretic aspects) 68R10 Graph theory (including graph drawing) in computer science 90B18 Communication networks in operations research Keywords:planar graphs; modular graphs; self-similar graphs; networks PDFBibTeX XMLCite \textit{F. Comellas} et al., J. Phys. A, Math. Theor. 42, No. 4, Article ID 045103, 10 p. (2009; Zbl 1165.05025) Full Text: DOI arXiv Link