ECCENTRIC DISTANCE SUM OF SIERPIŃSKI GASKET AND SIERPIŃSKI NETWORK
From MaRDI portal
Publication:4961151
DOI10.1142/S0218348X19500166zbMath1433.28009MaRDI QIDQ4961151
Publication date: 22 April 2020
Published in: Fractals (Search for Journal in Brave)
28A80: Fractals
Related Items
GEODESICS OF HIGHER-DIMENSIONAL SIERPINSKI GASKET, AVERAGE GEODESIC DISTANCE OF NODE-WEIGHTED SIERPINSKI NETWORKS, ARITHMETIC ON MORAN SETS, TWO-POINT RESISTANCES IN SAILBOAT FRACTAL NETWORKS, AVERAGE DISTANCES OF A FAMILY OF NON-P.C.F. SELF-SIMILAR NETWORKS, AVERAGE DISTANCES OF A FAMILY OF P.C.F. SELF-SIMILAR NETWORKS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some properties of energy measures on Sierpinski gasket type fractals
- On the eccentric distance sum of graphs
- Stochastic completeness for graphs with curvature dimension conditions
- The ``hot spots conjecture on higher dimensional Sierpinski gaskets
- The average distance on the Sierpiński gasket
- Multifractal analysis and topological properties of a new family of weighted Koch networks
- The tower of Hanoi
- Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
- The average eccentricity of Sierpiński graphs
- On the minimum eccentric distance sum of bipartite graphs with some given parameters
- Computing the eccentric-distance sum for graph operations
- Emergence of Scaling in Random Networks
- Isoperimetric Estimates on Sierpinski Gasket Type Fractals
- The Structure and Function of Complex Networks
- A lower bound for the Hausdorff measure of the Sierpinski gasket
- AVERAGE GEODESIC DISTANCE OF SIERPINSKI GASKET AND SIERPINSKI NETWORKS
- Collective dynamics of ‘small-world’ networks
- Shortest Paths in the Tower of Hanoi Graph and Finite Automata
- Networks