RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 1993 Volume 29, Issue 2, Pages 85–95 (Mi ppi179)
This article is cited in 3 papers

Large Systems

Lower Bounds of Connectedness Probability for Some Classes of Random Graphs

V. P. Polesskii


Abstract: Efficiently computable lower bounds of connectedness probability for classes of random graphs generated by 2-connected multigraphs with frameness or forestness 2 are established.

UDC: 621.391.1:519.4

Received: 06.04.1992


 English version: Problems of Information Transmission, 1993, 29:2, 176–185

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024