ASYMPTOTIC FORMULA OF ECCENTRIC DISTANCE SUM FOR VICSEK NETWORK

DOI10.1142/S0218348X18500275zbMath1433.28036WikidataQ126035656 ScholiaQ126035656MaRDI QIDQ4959951

Qianqian Ye, Long He, Li-Feng Xi, Qin Wang

Publication date: 7 April 2020

Published in: Fractals (Search for Journal in Brave)

zbMATH Keywords

Vicsek fractal; fractal network; eccentric distance

Mathematics Subject Classification ID

28A80: Fractals

Related Items

FRACTALITY OF SUBSTITUTION NETWORKS, MULTIPLE REPRESENTATIONS OF REAL NUMBERS ON SELF-SIMILAR SETS WITH OVERLAPS, AVERAGE GEODESIC DISTANCE OF NODE-WEIGHTED SIERPINSKI NETWORKS, ASYMPTOTIC FORMULA OF AVERAGE DISTANCES ON FRACTAL NETWORKS MODELED BY SIERPINSKI TETRAHEDRON, ARITHMETIC ON MORAN SETS, EIGENTIME IDENTITY FOR WEIGHT-DEPENDENT WALK ON A CLASS OF WEIGHTED FRACTAL SCALE-FREE HIERARCHICAL-LATTICE NETWORKS, Estimating the Hausdorff dimensions of univoque sets for self-similar sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the eccentric distance sum of graphs
• On the eccentric distance sum of trees and unicyclic graphs
• Stochastic completeness for graphs with curvature dimension conditions
• Further results on the eccentric distance sum
• Multifractal analysis and topological properties of a new family of weighted Koch networks
• Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
• Computing the eccentric-distance sum for graph operations
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• Collective dynamics of ‘small-world’ networks
• On the extremal values of the eccentric distance sum of trees
• Networks