AVERAGE DISTANCES OF A FAMILY OF NON-P.C.F. SELF-SIMILAR NETWORKS

DOI10.1142/S0218348X20500401zbMath1434.05047WikidataQ126355428 ScholiaQ126355428MaRDI QIDQ5112677

Bing Zhao, Li-Feng Xi, Jiangwen Gu

Publication date: 4 June 2020

Published in: Fractals (Search for Journal in Brave)

zbMATH Keywords

self-similarityaverage distancefractal networkfinite patternp.c.f. network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Fractals (28A80) Distance in graphs (05C12)

Related Items

AVERAGE DISTANCE OF SIERPINSKI-LIKE CARPET, MEAN GEODESIC DISTANCE OF n-LEVEL SIERPINSKI CARPET

Cites Work

• Unnamed Item
• Stochastic completeness for graphs with curvature dimension conditions
• Scale-free and small-world properties of Sierpinski networks
• Multifractal analysis and topological properties of a new family of weighted Koch networks
• Scale-free effect of substitution networks
• Average geodesic distance of skeleton networks of Sierpinski tetrahedron
• Emergence of Scaling in Random Networks
• The exact solution of the mean geodesic distance for Vicsek fractals
• AVERAGE GEODESIC DISTANCE OF SIERPINSKI GASKET AND SIERPINSKI NETWORKS
• FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS
• ECCENTRIC DISTANCE SUM OF SIERPIŃSKI GASKET AND SIERPIŃSKI NETWORK
• AVERAGE GEODESIC DISTANCE OF SIERPINSKI CARPET
• AVERAGE DISTANCE OF SELF-SIMILAR FRACTAL TREES
• Collective dynamics of ‘small-world’ networks