AVERAGE GEODESIC DISTANCE OF SIERPIŃSKI-TYPE NETWORKS
Cheng Zeng, Yuke Huang, Yumei Xue
Abstract
The well-known Sierpiński square is a fractal generated by iterated function system (IFS). In this paper, we focus on a class of fractal networks created by IFS. We show a universal approach to solve the average geodesic distance of these fractal networks.
Topics & Concepts
Iterated function systemGeodesicFractalMathematicsFocus (optics)Type (biology)Sierpinski triangleMathematical analysisTopology (electrical circuits)CombinatoricsPhysicsGeologyOpticsPaleontologyTopological and Geometric Data AnalysisMathematical Dynamics and FractalsComplex Network Analysis Techniques