Diskretnyi Analiz i Issledovanie Operatsii
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


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, 2016, Volume 23, Issue 2, Pages 5–20
DOI: https://doi.org/10.17377/daio.2016.23.501 (Mi da842) 		 
This article is cited in 16 scientific papers (total in 16 papers)

Enumeration of labeled connected graphs with given order and number of edges

V. A. Voblyi

Bauman Moscow State University, 5 2nd Baumanskaya St., 105005, Moscow, Russia
Full-text PDF (289 kB) Citations (16)
References:
PDF
HTML
DOI: https://doi.org/10.17377/daio.2016.23.501
Abstract: We deduce a new formula for the number of labeled connected graphs with a given order and number of edges in terms of the block generating function. Applying this formula, we exactly and asymptotically enumerate cacti with given order and cyclomatic number. Tab. 1, bibliogr. 22.
Keywords: enumeration, labeled graph, block, cactus, asymptotics.
Received: 13.07.2015
Revised: 14.12.2015
English version:
Journal of Applied and Industrial Mathematics, 2016, Volume 10, Issue 2, Pages 302–310
DOI: https://doi.org/10.1134/S1990478916020149
Bibliographic databases:
Document Type: Article
UDC: 519.175.3
Language: Russian
Citation: V. A. Voblyi, “Enumeration of labeled connected graphs with given order and number of edges”, Diskretn. Anal. Issled. Oper., 23:2 (2016), 5–20; J. Appl. Industr. Math., 10:2 (2016), 302–310
Citation in format AMSBIB
\Bibitem{Vob16}
\by V.~A.~Voblyi
\paper Enumeration of labeled connected graphs with given order and number of edges
\jour Diskretn. Anal. Issled. Oper.
\yr 2016
\vol 23
\issue 2
\pages 5--20
\mathnet{http://mi.mathnet.ru/da842}
\crossref{https://doi.org/10.17377/daio.2016.23.501}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3557591}
\elib{https://elibrary.ru/item.asp?id=26129764}
\transl
\jour J. Appl. Industr. Math.
\yr 2016
\vol 10
\issue 2
\pages 302--310
\crossref{https://doi.org/10.1134/S1990478916020149}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84971219376}
Linking options:
  • https://www.mathnet.ru/eng/da842
  • https://www.mathnet.ru/eng/da/v23/i2/p5
    • This publication is cited in the following 16 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:352
    Full-text PDF :160
    References:51
    First page:10
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024