Diameters of Random Graphs

DOI10.4153/CJM-1981-050-1MaRDI QIDQ3852218zbMATH OpenFDO

Authors Victor Klee, D. G. Larman

Publication date 1981

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

Full work available at URL https://doi.org/10.4153/CJM-1981-050-1

zbMATH Keywords

diametersrandom graphs

Mathematics Subject Classification ID

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

Cited in

(11)

• On the relationship between variable Wiener index and variable Szeged index
• The average distance and the diameter of dense random regular graphs
• Identifying codes and searching with balls in graphs
• Stochastic Kronecker graphs
• On the diameters of commuting graphs arising from random skew-symmetric matrices.
• The diameter of sparse random graphs
• Efficient algorithms for cluster editing
• Concentration of hitting times in Erdős-Rényi graphs
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Distributed algorithms for random 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)