The diameter of random regular graphs
From MaRDI portal
Cites work
Cited in
(40)- Distant irregularity strength of graphs
- Graphs on alphabets as models for large interconnection networks
- On Lipschitz extension from finite subsets
- On minimum vertex bisection of random \(d\)-regular graphs
- Diameters of random circulant graphs
- Statistics of Feynman amplitudes in \(\phi^4\)-theory
- Distant sum distinguishing index of graphs
- Asymptotically large (\(\Delta,D\))-graphs
- Near-optimal radio use for wireless network synchronization
- The diameter of sparse random graphs
- Random graphs, weak coarse embeddings, and higher index theory
- The diameter of weighted random graphs
- Assouad-Nagata dimension and gap for ordered metric spaces
- 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
- Expander graphs and gaps between primes
- The birth of geometry in exponential random graphs
- The diameter of the directed configuration model
- The diameter of random Belyĭ surfaces
- Critical window for the vacant set left by random walk on random regular graphs
- First passage percolation on inhomogeneous random graphs
- Graphs with small diameter after edge deletion
- The mean and variance of the distribution of shortest path lengths of random regular graphs
- A model for random three-manifolds
- The diameter of randomly twisted hypercubes
- Diameter and stationary distribution of random \(r\)-out digraphs
- A note on the rainbow connection of random regular graphs
- A hypercube variant with small diameter
- On the minimal diameter of closed hyperbolic surfaces
- Deterministic small-world networks
- Pseudo-random hypergraphs
- Tables of large graphs with given degree and diameter
- Expanders with respect to Hadamard spaces and random graphs
- 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)