The average distance and the diameter of dense random regular graphs

DOI10.37236/8705zbMATH Open1448.05182OpenAlexW3107911479MaRDI QIDQ2200440FDOQ2200440

Authors: Nobutaka Shimizu 

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

Recommendations

• The diameter of dense random regular graphs
• The diameter of sparse random graphs
• The Average Distance in a Random Graph with Given Expected Degrees
• Random regular graphs of high degree
• The average distances in random graphs with given expected degrees

zbMATH Keywords

switching methodembedding theorem

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12)

Cites Work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Random graphs.
• The Diameter of Random Graphs
• The Average Distance in a Random Graph with Given Expected Degrees
• Moore graphs and beyond: a survey of the degree/diameter problem
• On Moore Graphs with Diameters 2 and 3
• Maximum degree in graphs of diameter 2
• The asymptotic number of labeled graphs with given degree sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• The diameter of random regular graphs
• Generating Random Regular Graphs Quickly
• Sandwiching random graphs: universality between random graph models
• Introduction to Random Graphs
• Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
• Generating random regular graphs
• Distances in random graphs with finite variance degrees
• Uniform generation of random regular graphs of moderate degree
• Small subgraphs of random regular graphs
• The diameter of sparse random graphs
• Title not available (Why is that?)
• The diameter of sparse random graphs
• The diameter of sparse random graphs
• Universality for distances in power-law random graphs
• Diameters of Random Graphs
• Uniform generation of random regular graphs
• Sandwiching random regular graphs between binomial random graphs
• Theory of evolutionary computation. Recent developments in discrete optimization
• The diameter of dense random regular graphs

Cited In (2)

• The mean and variance of the distribution of shortest path lengths of random regular graphs
• The diameter of dense random regular graphs

This page was built for publication: The average distance and the diameter of dense random regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200440)