Mapping Koch curves into scale-free small-world networks

From MaRDI portal
Publication:3052863

DOI10.1088/1751-8113/43/39/395101zbMath1213.28004arXiv0810.3313OpenAlexW3099293897MaRDI QIDQ3052863

Shuyang Gao, Hongjuan Zhang, Zhong-Zhi Zhang, Jihong Guan, Lichao Chen, Shuigeng Zhou

Publication date: 3 November 2010

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

Full work available at URL: https://arxiv.org/abs/0810.3313




Related Items (20)

Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walkMultifractal analysis and topological properties of a new family of weighted Koch networksWEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHSCounting spanning trees of a type of generalized Farey graphsA key heterogeneous structure of fractal networks based on inverse renormalization schemeA new fractal reliability model for networks with node fractal growth and no-loopRandom walks on non-homogenous weighted Koch networksA deterministic pseudo-fractal networks with time-delayEntropy and enumeration of spanning connected unicyclic subgraphs in self-similar networkEfficiency of transportation on weighted extended Koch networksGraph concatenations to derive weighted fractal networksThe evaluation of the number and the entropy of spanning trees on generalized small-world networksStructure properties of Koch networks based on networks dynamical systemsEnumeration of spanning trees in planar unclustered networksPotts model partition functions on two families of fractal latticesTopological properties of a 3-regular small world networkCounting spanning trees in self-similar networks by evaluating determinantsVertex labeling and routing for Farey-type symmetrically-structured graphsImpact of degree heterogeneity on the behavior of trapping in Koch networksScaling of average weighted shortest path and average receiving time on weighted expanded Koch networks




This page was built for publication: Mapping Koch curves into scale-free small-world networks