Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 1990, Volume 2, Issue 3, Pages 137–145 (Mi dm877)  
This article is cited in 2 scientific papers (total in 2 papers)

On the number of cycles in a random nonequiprobable graph

V. F. Kolchin, V. I. Khokhlov
Full-text PDF (899 kB) Citations (2)
Received: 01.02.1990
Bibliographic databases:
Document Type: Article
UDC: 519.21
Language: Russian
Citation: V. F. Kolchin, V. I. Khokhlov, “On the number of cycles in a random nonequiprobable graph”, Diskr. Mat., 2:3 (1990), 137–145; Discrete Math. Appl., 2:1 (1992), 109–128
Citation in format AMSBIB
\Bibitem{KolKho90}
\by V.~F.~Kolchin, V.~I.~Khokhlov
\paper On the number of cycles in a~random nonequiprobable graph
\jour Diskr. Mat.
\yr 1990
\vol 2
\issue 3
\pages 137--145
\mathnet{http://mi.mathnet.ru/dm877}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1084076}
\zmath{https://zbmath.org/?q=an:0778.05076|0757.05092}
\transl
\jour Discrete Math. Appl.
\yr 1992
\vol 2
\issue 1
\pages 109--128
Linking options:
  • https://www.mathnet.ru/eng/dm877
  • https://www.mathnet.ru/eng/dm/v2/i3/p137
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:483
    Full-text PDF :306
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024