Fractal networks: topology, dimension, and complexity
From MaRDI portal
Publication:6554415
Cites work
- A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
- Connected components in random graphs with given expected degree sequences
- Covering graphs by the minimum number of equivalence relations
- DEFINING DIMENSION OF A COMPLEX NETWORK
- Entropy and the complexity of graphs revisited
- Factorisation of snarks
- Graph fractal dimension and the structure of fractal networks
- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
- scientific article; zbMATH DE number 992948 (Why is no real title available?)
- scientific article; zbMATH DE number 3827200 (Why is no real title available?)
- scientific article; zbMATH DE number 1866312 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Kolmogorov complexity and Hausdorff dimension
- Large cliques in a power-law random graph
- Line Graphs of Helly Hypergraphs
- Modularity of regular and treelike graphs
- Networks
- On a product dimension of graphs
- On an estimate of the chromatic class of a \(p\)-graph
- On the product dimension of clique factors
- Paths in graphs
- Prague dimension of random graphs
- Robustness and Vulnerability of Scale-Free Random Graphs
- Specialization models of network growth
- The complexity and effectiveness of prediction algorithms
- The NP-Completeness of Edge-Coloring
- The Structure and Function of Complex Networks
This page was built for publication: Fractal networks: topology, dimension, and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6554415)
