|
Problemy Peredachi Informatsii, 1992, Volume 28, Issue 2, Pages 86–95
(Mi ppi1349)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Communication Network Theory
Lower Bounds on the Probability of Connectedness in Classes of Random Graphs Generated by 2-Connected Graphs with a Given Base Spectrum
V. P. Polesskii
Abstract:
We develop a previous result which claims that the base spectrum of the cycle matroid of a graph provides a lower bound on the probability of connectedness of the corresponding random graph. A random graph with a minimum probability of connectedness is constructed in the class of random graphs generated by 2-connected graphs representable as a partition of their two trees.
Received: 17.09.1991
Citation:
V. P. Polesskii, “Lower Bounds on the Probability of Connectedness in Classes of Random Graphs Generated by 2-Connected Graphs with a Given Base Spectrum”, Probl. Peredachi Inf., 28:2 (1992), 86–95; Problems Inform. Transmission, 28:2 (1992), 175–183
Linking options:
https://www.mathnet.ru/eng/ppi1349 https://www.mathnet.ru/eng/ppi/v28/i2/p86
|
Statistics & downloads: |
Abstract page: | 247 | Full-text PDF : | 118 |
|