Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


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
Bibliographic databases:
Document Type: Article
UDC: 621.395.74:513.8
Language: Russian
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
Citation in format AMSBIB
\Bibitem{Pol92}
\by V.~P.~Polesskii
\paper Lower Bounds on the Probability of Connectedness in Classes of Random Graphs Generated by 2-Connected Graphs with a~Given Base Spectrum
\jour Probl. Peredachi Inf.
\yr 1992
\vol 28
\issue 2
\pages 86--95
\mathnet{http://mi.mathnet.ru/ppi1349}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1178421}
\zmath{https://zbmath.org/?q=an:0793.05111}
\transl
\jour Problems Inform. Transmission
\yr 1992
\vol 28
\issue 2
\pages 175--183
Linking options:
  • https://www.mathnet.ru/eng/ppi1349
  • https://www.mathnet.ru/eng/ppi/v28/i2/p86
  • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:247
    Full-text PDF :118
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024