The Strength of Connectivity of a Random Graph
Teoriâ veroâtnostej i ee primeneniâ, Tome 18 (1973) no. 2, pp. 417-425
Cet article a éte moissonné depuis la source Math-Net.Ru
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.
@article{TVP_1973_18_2_a27,
author = {G. I. Ivchenko},
title = {The {Strength} of {Connectivity} of a {Random} {Graph}},
journal = {Teori\^a vero\^atnostej i ee primeneni\^a},
pages = {417--425},
year = {1973},
volume = {18},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TVP_1973_18_2_a27/}
}
G. I. Ivchenko. The Strength of Connectivity of a Random Graph. Teoriâ veroâtnostej i ee primeneniâ, Tome 18 (1973) no. 2, pp. 417-425. http://geodesic.mathdoc.fr/item/TVP_1973_18_2_a27/