Random Graphs and Networks: A First Course
From MaRDI portal
Recommendations
Cited in
(14)- Random graphs and complex networks. Volume 1
- Introduction to Random Graphs
- The mathematics of finite networks. An introduction to operator graph theory
- Complex graphs and networks
- Small but unwieldy: a lower bound on adjacency labels for small classes
- Polynomial growth in degree-dependent first passage percolation on spatial random graphs
- Dynamic topology and percolation criticality in higher-order activity-vulnerability driven networks
- Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs
- Tight bounds on adjacency labels for monotone graph classes
- Clique structure and other network properties of the tensor product of Erdős-Rényi graphs
- Chromatic number of random graphs: an approach using a recurrence relation
- Siblings in d-dimensional nearest neighbour trees
- Upper bounds for linear graph codes
- Targeted least cardinality candidate key for relational databases
This page was built for publication: Random Graphs and Networks: A First Course
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5872441)