On the diameter of a class of random graphs

DOI10.1109/18.52474MaRDI QIDQ3476843zbMATH OpenOpenAlexFDO

Authors Thomas K. Philips, Don Towsley, Jack Keil Wolf

Publication date 1990

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.52474

zbMATH Keywords

diameterrandom directed graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• The diameter of a random graph with bounded diameter
• On the diameter of random planar graphs
• On the diameter of random planar graphs
• Diameters of random distance graphs
• Diameters of random circulant graphs
• scientific article; zbMATH DE number 4055665
• The diameter of inhomogeneous random graphs
• The diameter of weighted random graphs
• On the diameter of hyperbolic random graphs

Cited in

(25)

• Energy efficient randomised communication in unknown AdHoc networks
• Probability of diameter two for Steinhaus graphs
• Stretch and diameter in random geometric graphs
• A note on the localization number of random graphs: diameter two case
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• Diameters of random circulant graphs
• The diameter of the directed configuration model
• The diameter of random massive graphs
• An estimate of the probability of localisation of the diameter of a random scale-free graph
• scientific article; zbMATH DE number 6616703 (Why is no real title available?)
• Almost Every Randomly Near-Traceable Graph has Diameter at Most Two
• scientific article; zbMATH DE number 4055665 (Why is no real title available?)
• scientific article; zbMATH DE number 2076942 (Why is no real title available?)
• The diameter of inhomogeneous random graphs
• The diameter of a random graph with bounded diameter
• A Bound for the Diameter of Random Hyperbolic Graphs
• Stochastic Kronecker graphs
• On distribution function of the diameter in uncertain graph
• The diameter of randomly perturbed digraphs and some applications
• The diameter of sparse random graphs
• A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs
• The diameter of sparse random graphs
• Measures of information spread, spanning trees, and walks in regular graphs
• Measures of information spread in digraphs
• Diameter and stationary distribution of random r-out digraphs

This page was built for publication: On the diameter of a class of random graphs

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