Generating Fibonacci-model as evolution of networks with vertex-velocity and time-memory
From MaRDI portal
Publication:2161760
DOI10.1016/j.physa.2019.121295OpenAlexW2943098455WikidataQ127963691 ScholiaQ127963691MaRDI QIDQ2161760
Publication date: 5 August 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2019.121295
Related Items (2)
AVERAGE FERMAT DISTANCES OF TWO-COLORED SUBSTITUTION NETWORKS ⋮ Random walks on Fibonacci treelike models
Cites Work
- Farey graphs as models for complex networks
- Synchronization in weighted scale-free networks with degree-degree correlation
- A scaling method for priorities in hierarchical structures
- Fractality and scale-free effect of a class of self-similar networks
- The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
- An iteration method for computing the total number of spanning trees and its applications in graph theory
- Loop-erased random walks, spanning trees and Hamiltonian cycles
- A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters
- Scale-free effect of substitution networks
- A family of small-world network models built by complete graph and iteration-function
- Fractality of evolving self-similar networks
- The number of spanning trees in Apollonian networks
- Emergence of Scaling in Random Networks
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- A critical point for random graphs with a given degree sequence
- MARKOV SPECTRA OF SELF-SIMILAR NETWORKS BY SUBSTITUTION RULE
- Collective dynamics of ‘small-world’ networks
- Deterministic scale-free networks
- Unnamed Item
- Unnamed Item
This page was built for publication: Generating Fibonacci-model as evolution of networks with vertex-velocity and time-memory
