Abstract
We consider graphs and digraphs obtained by randomly generating a prescribed number of arcs incident at each vertex.
We analyse their almost certain connectivity and apply these results to the expected value of random minimum length spanning trees and arborescences.
We also examine the relationship between our results and certain results of Erdős and Rényi.
Similar content being viewed by others
References
P. Erdős andA. Rényi, On Random Graphs I,Publ. Math. Debrecen,6 (1959), 290–297.
P. Erdős andA. Rényi, On the Evolution of Random Graphs,Magyar Tud. Akad. Mat. Kut. Int. Közl. 5 (1960), 17–61.
P. Erdős andA. Rényi, On the Strength of Connectedness of a Random Graph,Acta. Math. Acad. Sci. Hungar.,12 (1961), 261–267.
L. Katz, Probability of Indecomposability of a Random Mapping Function,Annals of Mathematical Statistics,25 (1955), 512–517.
M. Kruskal, The Expected Number of Components under a Random Mapping Function, American Mathematical Monthly,61 (1954), 392–397.
D. W. Walkup, On the Expected Value of a Random Assignment Problem,SIAM Journal on Computing,8 (1979), 440–442.
T. I. Fenner andA. M. Frieze, On the existence of Hamiltonian cycles in a class of random graphs,to appear in Discr. Math.
A. Frank andA. Gyárfás, How to orient the edges of a graph?, 1976 Colloq. Math. Soch. J. Bolyai18 (1978), 353–364.