Average Fermat distances of two-colored substitution networks
From MaRDI portal
Publication:5044599
DOI10.1142/S0218348X22501055zbMATH Open1502.05231OpenAlexW4225389383MaRDI QIDQ5044599FDOQ5044599
Authors: Lei Lei, Qi Jia, Lifeng Xi 
Publication date: 2 November 2022
Published in: Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218348x22501055
Recommendations
- Average distance of substitution networks
- Node-weighted average Fermat distances of fractal tree networks
- Asymptotic formula of average distances on fractal networks modeled by Sierpinski tetrahedron
- ECCENTRIC DISTANCE SUM OF SUBSTITUTION TREE NETWORKS
- AVERAGE DISTANCES OF A FAMILY OF P.C.F. SELF-SIMILAR NETWORKS
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Fractals (28A80)
Cites Work
- Title not available (Why is that?)
- Substitutions in dynamics, arithmetics and combinatorics
- Geometric methods and optimization problems
- Directions in Mathematical Quasicrystals
- Undecidability and nonperiodicity for tilings of the plane
- The exact solution of the mean geodesic distance for Vicsek fractals
- Network coherence and eigentime identity on a family of weighted fractal networks
- Generalized adjacency and Laplacian spectra of the weighted corona graphs
- Generating Fibonacci-model as evolution of networks with vertex-velocity and time-memory
- Scale-free effect of substitution networks
- Searching efficiency of multiple walkers on the weighted networks
- The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network
- Fractality of multiple colored substitution networks
- Average distances on substitution trees
- Fractality of substitution networks
- ECCENTRIC DISTANCE SUM OF SUBSTITUTION TREE NETWORKS
- Average distance of substitution networks
- Average distance of self-similar fractal trees
- Laplacian spectrum and coherence analysis of weighted hypercube network
- SELF-SIMILAR TOUCHING NETWORKS — PART II
- Two-point resistances in sailboat fractal networks
- AVERAGE FERMAT DISTANCE OF A FRACTAL TREE
- SELF-SIMILAR TOUCHING NETWORKS — PART I
- NODE-WEIGHTED AVERAGE FERMAT DISTANCES OF FRACTAL TREE NETWORKS
- AVERAGE FERMAT DISTANCES ON VICSEK NETWORKS
- MEAN STEINER DISTANCE OF VICSEK NETWORKS
- CONVERGENCE RATE AND GLOBAL MEAN WEIGHTED FIRST-PASSAGE TIME IN A 1D CHAIN NETWORK WITH A WEIGHTED ADDING REVERSE EDGE
Cited In (2)
This page was built for publication: Average Fermat distances of two-colored substitution networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044599)
