The diameter of a random graph with bounded diameter
From MaRDI portal
Publication:4697809
DOI10.1002/RSA.3240060206zbMATH Open0819.05055OpenAlexW2094395538MaRDI QIDQ4697809FDOQ4697809
Authors: David A. Grable
Publication date: 5 September 1995
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240060206
Recommendations
Cited In (17)
- A Bound for the Diameter of Random Hyperbolic Graphs
- On the diameter of random planar graphs
- The diameter of sparse random graphs
- The diameter of sparse random graphs
- The Diameter of a Cycle Plus a Random Matching
- Almost Every Randomly Near-Traceable Graph has Diameter at Most Two
- Diameters of random distance graphs
- Asymptotic approximation for the number of \(n\)-vertex graphs of given diameter
- Title not available (Why is that?)
- Title not available (Why is that?)
- An asymptotic formula for the number of graphs having small diameter
- On the diameter of random planar graphs
- On the diameter of a class of random graphs
- Diameters of random bipartite graphs
- Probability of diameter two for Steinhaus graphs
- A note on the localization number of random graphs: diameter two case
- On distribution function of the diameter in uncertain graph
This page was built for publication: The diameter of a random graph with bounded diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4697809)