The average distance and the diameter of dense random regular graphs
From MaRDI portal
Publication:2200440
DOI10.37236/8705zbMath1448.05182OpenAlexW3107911479MaRDI QIDQ2200440
Publication date: 21 September 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/8705
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
- Small subgraphs of random regular graphs
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The asymptotic number of labeled graphs with given degree sequences
- The diameter of random regular graphs
- Sandwiching random graphs: universality between random graph models
- Moore graphs and beyond: a survey of the degree/diameter problem
- Introduction to Random Graphs
- On Moore Graphs with Diameters 2 and 3
- Uniform generation of random regular graphs of moderate degree
- Universality for distances in power-law random graphs
- Diameters of Random Graphs
- Maximum degree in graphs of diameter 2
- The Diameter of Random Graphs
- The Average Distance in a Random Graph with Given Expected Degrees
- Generating Random Regular Graphs Quickly
- The Diameter of Sparse Random Graphs
- Uniform Generation of Random Regular Graphs
- Sandwiching random regular graphs between binomial random graphs
- Theory of Evolutionary Computation
- Distances in random graphs with finite variance degrees
- The diameter of sparse random graphs
- Generating random regular graphs
- The diameter of sparse random graphs
This page was built for publication: The average distance and the diameter of dense random regular graphs
