Diameters of Random Graphs

DOI10.4153/CJM-1981-050-1zbMATH Open0419.05036MaRDI QIDQ3852218FDOQ3852218

Authors: Victor Klee, D. G. Larman 

Publication date: 1981

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

random graphsdiameters

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Combinatorial probability (60C05) Paths and cycles (05C38)

Cited In (9)

• Efficient algorithms for cluster editing
• Distributed algorithms for random graphs
• The diameter of sparse random graphs
• Identifying codes and searching with balls in graphs
• On the diameters of commuting graphs arising from random skew-symmetric matrices.
• Concentration of hitting times in Erdős-Rényi graphs
• On the relationship between variable Wiener index and variable Szeged index
• Stochastic Kronecker graphs
• The average distance and the diameter of dense random regular graphs

This page was built for publication: Diameters of Random Graphs

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