Self-similar non-clustered planar graphs as models for complex networks

DOI10.1088/1751-8113/42/4/045103MaRDI QIDQ3600536zbMATH OpenOpenAlexFDO

Authors Francesc Comellas, Zhongzhi Zhang, Lichao Chen

Publication date 10 February 2009

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0806.1258, http://hdl.handle.net/2117/2451

zbMATH Keywords

modular graphsnetworksplanar graphsself-similar graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18)

Abstract: 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.

Recommendations

• Self-similar planar graphs as models for complex networks
• Deterministic self-similar models of complex networks based on very symmetric graphs
• A planar scale-free graph as network model
• Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks
• A new class of the planar networks with high clustering and high entropy
• Simplex triangulation induced scale-free networks
• Fractality and scale-free effect of a class of self-similar networks
• Complex networks modeled on the Sierpinski gasket
• Self-similarity of graphs

Cited in

(7)

• Deterministic self-similar models of complex networks based on very symmetric graphs
• Label-based routing for a family of scale-free, modular, planar and unclustered graphs
• Self-similar planar graphs as models for complex networks
• Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks
• A planar scale-free graph as network model
• Topology of Cell-Aggregated Planar Graphs
• Incompatibility networks as models of scale-free small-world graphs

This page was built for publication: Self-similar non-clustered planar graphs as models for complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600536)