This article is cited in 9 papers

Short Communications

The Strength of Connectivity of a Random Graph

G. I. Ivchenko

Moscow

Abstract: The correspondence between the minimum degree of vertices and the strength of connectedness of a random graph is studied, and the distribution of a random moment ot which the graph becomes $m$-connected for the first time is investigated.

Received: 25.10.1971

 English version: Theory of Probability and its Applications, 1973, 18:2, 396–403

Bibliographic databases:

• 
•