The diameter of random regular graphs

DOI10.1007/BF02579310zbMATH Open0505.05053OpenAlexW2040232420MaRDI QIDQ1835933FDOQ1835933

Authors: Béla Bollobás, W. Fernandez de la Vega 

Publication date: 1982

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579310

zbMATH Keywords

diameterasymptotic bounds

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites Work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Title not available (Why is that?)

Cited In (40)

• Distant irregularity strength of graphs
• Graphs on alphabets as models for large interconnection networks
• On minimum vertex bisection of random \(d\)-regular graphs
• Statistics of Feynman amplitudes in \(\phi^4\)-theory
• On Lipschitz extension from finite subsets
• Diameters of random circulant graphs
• Distant sum distinguishing index of graphs
• Asymptotically large (\(\Delta,D\))-graphs
• The diameter of sparse random graphs
• Near-optimal radio use for wireless network synchronization
• Random graphs, weak coarse embeddings, and higher index theory
• Assouad-Nagata dimension and gap for ordered metric spaces
• The diameter of weighted random graphs
• Finite size scaling functions of the phase transition in the ferromagnetic Ising model on random regular graphs
• Comparison of metric spectral gaps
• On certain connectivity properties of the internet topology
• Stationary distribution and cover time of sparse directed configuration models
• The birth of geometry in exponential random graphs
• Expander graphs and gaps between primes
• The diameter of the directed configuration model
• The diameter of random Belyĭ surfaces
• First passage percolation on inhomogeneous random graphs
• Critical window for the vacant set left by random walk on random regular graphs
• Graphs with small diameter after edge deletion
• The diameter of randomly twisted hypercubes
• The mean and variance of the distribution of shortest path lengths of random regular graphs
• A model for random three-manifolds
• A hypercube variant with small diameter
• A note on the rainbow connection of random regular graphs
• Diameter and stationary distribution of random \(r\)-out digraphs
• On the minimal diameter of closed hyperbolic surfaces
• Deterministic small-world networks
• Expanders with respect to Hadamard spaces and random graphs
• Pseudo-random hypergraphs
• Tables of large graphs with given degree and diameter
• Analytical results for the distribution of first-passage times of random walks on random regular graphs
• The average distance and the diameter of dense random regular graphs
• Non-hyperbolicity in random regular graphs and their traffic characteristics
• Meeting the deadline: on the complexity of fault-tolerant continuous gossip
• Kissing numbers of regular graphs

This page was built for publication: The diameter of random regular graphs

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