On the diameter of a class of random graphs

DOI10.1109/18.52474zbMath0699.05046OpenAlexW2130077159MaRDI QIDQ3476843

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

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

Related Items

The diameter of sparse random graphs, Stochastic kronecker graphs, A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs, Energy efficient randomised communication in unknown AdHoc networks