|
Teoriya Veroyatnostei i ee Primeneniya, 1972, Volume 17, Issue 2, Pages 253–265
(Mi tvp2526)
|
|
|
|
This article is cited in 19 scientific papers (total in 19 papers)
Asymptotic formulas for the probability of $k$-connectedness of random graphs
A. K. Kel'mans Moscow
Abstract:
For graphs with vertices of sufficiently large, in a certain sense, degrees, asymptotical formulas are derived for the probability of $k$-connectedness of vertex subsets provided the edges of graphs are removed independently with given probabilities.
Received: 22.07.1970
Citation:
A. K. Kel'mans, “Asymptotic formulas for the probability of $k$-connectedness of random graphs”, Teor. Veroyatnost. i Primenen., 17:2 (1972), 253–265; Theory Probab. Appl., 17:2 (1973), 243–254
Linking options:
https://www.mathnet.ru/eng/tvp2526 https://www.mathnet.ru/eng/tvp/v17/i2/p253
|
Statistics & downloads: |
Abstract page: | 193 | Full-text PDF : | 89 |
|