Pages that link to "Item:Q2393182"
From MaRDI portal
The following pages link to Generating hierarchial scale-free graphs from fractals (Q2393182):
Displaying 19 items.
- Emergence of fractal scale-free networks from stochastic evolution on the Cayley tree (Q480094) (← links)
- The modified box dimension and average weighted receiving time of the weighted hierarchical graph (Q1620614) (← links)
- Fractality and scale-free effect of a class of self-similar networks (Q1620632) (← links)
- Deterministic self-similar models of complex networks based on very symmetric graphs (Q1673212) (← links)
- Line graphs for fractals (Q2005098) (← links)
- Fractal networks with Sturmian structure (Q2069086) (← links)
- Asymptotic degree distribution in a homogeneous evolving network model (Q2105409) (← links)
- Fractality and the small-world property of generalised \((u,v)\)-flowers (Q2120697) (← links)
- Scale-free and small-world properties of a multiple-hub network with fractal structure (Q2141849) (← links)
- Growth model for fractal scale-free networks generated by a random walk (Q2157181) (← links)
- Scaling of the average weighted receiving time on a family of double-weighted hierarchical networks (Q2162066) (← links)
- The devil is in the details: spectrum and eigenvalue distribution of the discrete Preisach memory model (Q2206545) (← links)
- Asymptotic formula on average path length in a hierarchical scale-free network with fractal structure (Q2213579) (← links)
- A box-covering algorithm for fractal scaling in scale-free networks (Q3624829) (← links)
- Transfinite fractal dimension of trees and hierarchical scale-free graphs (Q4958788) (← links)
- Graph fractal dimension and the structure of fractal networks (Q5022502) (← links)
- ANALYSES OF SOME STRUCTURAL PROPERTIES ON A CLASS OF HIERARCHICAL SCALE-FREE NETWORKS (Q5046645) (← links)
- FRACTAL NETWORKS ON SIERPINSKI-TYPE POLYGON (Q5129911) (← links)
- A class of scale-free networks with fractal structure based on subshift of finite type (Q5347049) (← links)
