Topology of Cell-Aggregated Planar Graphs

DOI10.1007/11758532_150zbMATH Open1157.05332OpenAlexW1567023770MaRDI QIDQ5503261FDOQ5503261

Authors Milovan Šuvakov, Bosiljka Tadić

Publication date 13 January 2009

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cond-mat/0605455

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10)

Abstract: We present new algorithm for growth of non-clustered planar graphs by aggregation of cells with given distribution of size and constraint of connectivity k=3 per node. The emergent graph structures are controlled by two parameters--chemical potential of the cell aggregation and the width of the cell size distribution. We compute several statistical properties of these graphs--fractal dimension of the perimeter, distribution of shortest paths between pairs of nodes and topological betweenness of nodes and links. We show how these topological properties depend on the control parameters of the aggregation process and discuss their relevance for the conduction of current in self-assembled nanopatterns.

Recommendations

• Topological correlations in cellular structures and planar graph theory
• Self-similar non-clustered planar graphs as models for complex networks
• Self-similar planar graphs as models for complex networks
• The Role of Topology in Growth and Agglomeration
• Topology and local geometry of the Eden model

Cited in

(3)

• Topological correlations in cellular structures and planar graph theory
• Nanonetworks: the graph theory framework for modeling nanoscale systems
• The Role of Topology in Growth and Agglomeration

This page was built for publication: Topology of Cell-Aggregated Planar Graphs

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