Graph concatenations to derive weighted fractal networks
From MaRDI portal
Publication:2205279
DOI10.1155/2020/4906878zbMath1444.05135OpenAlexW3043333655MaRDI QIDQ2205279
Publication date: 20 October 2020
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/4906878
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Signed and weighted graphs (05C22) Fractional graph theory, fuzzy graph theory (05C72)
Cites Work
- Unnamed Item
- Unnamed Item
- Incompatibility networks as models of scale-free small-world graphs
- Average distances on substitution trees
- Complex networks: structure and dynamics
- Uniform cantor sets as hyperbolic boundaries
- Mapping Koch curves into scale-free small-world networks
- Lectures on Complex Networks
- The Structure and Function of Complex Networks
- AVERAGE DISTANCE OF SELF-SIMILAR FRACTAL TREES
- A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy
- A Generalization of the Von Koch Curve
- Deterministic scale-free networks
This page was built for publication: Graph concatenations to derive weighted fractal networks