The Diameter of Random Graphs
From MaRDI portal
Publication:3936765
DOI10.2307/1998567zbMATH Open0479.05038OpenAlexW4242518419MaRDI QIDQ3936765FDOQ3936765
Publication date: 1981
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1998567
Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Enumeration in graph theory (05C30)
Cited In (19)
- Algorithms and almost tight results for 3-colorability of small diameter graphs
- Diameters of random circulant graphs
- Large random graphs in pseudo-metric spaces
- Identifying codes and searching with balls in graphs
- On the local distinguishing numbers of cycles
- On the threshold for rainbow connection number \(r\) in random graphs
- Rainbow \(k\)-connectivity of random bipartite graphs
- Diameter in ultra‐small scale‐free random graphs
- Edge and pair queries-random graphs and complexity
- Rainbow connectivity and rainbow index of inhomogeneous random graphs
- A distributed algorithm for finding Hamiltonian cycles in random graphs in \(O(\log n)\) time
- Geodesic cycles in random graphs
- On rainbow-\(k\)-connectivity of random graphs
- Strong and weighted matchings in inhomogenous random graphs
- Network analysis of the Kyiv bylyny cycle -- East Slavic epic narratives
- Sieve methods in random graph theory
- Rainbow and monochromatic vertex-connection of random graphs
- The average distance and the diameter of dense random regular graphs
- Distance-Uniform Graphs with Large Diameter
This page was built for publication: The Diameter of Random Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936765)
