Geodesic
The Strength of Connectivity of a Random Graph
Teoriâ veroâtnostej i ee primeneniâ, Tome 18 (1973) no. 2, pp. 417-425

Voir la notice de l'article provenant de 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},
     publisher = {mathdoc},
     volume = {18},
     number = {2},
     year = {1973},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TVP_1973_18_2_a27/}
}
TY  - JOUR
AU  - G. I. Ivchenko
TI  - The Strength of Connectivity of a Random Graph
JO  - Teoriâ veroâtnostej i ee primeneniâ
PY  - 1973
SP  - 417
EP  - 425
VL  - 18
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TVP_1973_18_2_a27/
LA  - ru
ID  - TVP_1973_18_2_a27
ER  - 
%0 Journal Article
%A G. I. Ivchenko
%T The Strength of Connectivity of a Random Graph
%J Teoriâ veroâtnostej i ee primeneniâ
%D 1973
%P 417-425
%V 18
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TVP_1973_18_2_a27/
%G ru
%F 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/