RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Subscription
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



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






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


Mat. Zametki, 2012, Volume 92, Issue 5, Pages 678–683 (Mi mz9185)  

This article is cited in 2 scientific papers (total in 2 papers)

Enumeration of Labeled Bicyclic and Tricyclic Eulerian Graphs

V. A. Voblyi

N. E. Bauman Moscow State Technical University

Abstract: Explicit formulas for the number of labeled bicyclic and tricyclic Eulerian graphs and for the number of labeled tricyclic Eulerian blocks are obtained. Many-vertex asymptotics for these numbers are found.

Keywords: labeled Eulerian graph, bicyclic Eulerian graph, tricyclic Eulerian graph, Eulerian block, enumeration of graphs, generating function

DOI: https://doi.org/10.4213/mzm9185

Full text: PDF file (402 kB)
References: PDF file   HTML file

English version:
Mathematical Notes, 2012, 92:5, 619–623

Bibliographic databases:

UDC: 517.175.3
Received: 30.06.2011

Citation: V. A. Voblyi, “Enumeration of Labeled Bicyclic and Tricyclic Eulerian Graphs”, Mat. Zametki, 92:5 (2012), 678–683; Math. Notes, 92:5 (2012), 619–623

Citation in format AMSBIB
\Bibitem{Vob12}
\by V.~A.~Voblyi
\paper Enumeration of Labeled Bicyclic and Tricyclic Eulerian Graphs
\jour Mat. Zametki
\yr 2012
\vol 92
\issue 5
\pages 678--683
\mathnet{http://mi.mathnet.ru/mz9185}
\crossref{https://doi.org/10.4213/mzm9185}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3201470}
\zmath{https://zbmath.org/?q=an:1261.05044}
\elib{http://elibrary.ru/item.asp?id=20731625}
\transl
\jour Math. Notes
\yr 2012
\vol 92
\issue 5
\pages 619--623
\crossref{https://doi.org/10.1134/S0001434612110041}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000314263900004}
\elib{http://elibrary.ru/item.asp?id=20484616}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84871840860}


Linking options:
  • http://mi.mathnet.ru/eng/mz9185
  • https://doi.org/10.4213/mzm9185
  • http://mi.mathnet.ru/eng/mz/v92/i5/p678

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. V. A. Voblyi, A. K. Meleshko, “Perechislenie pomechennykh eilerovykh tetratsiklicheskikh grafov”, Diskretn. analiz i issled. oper., 21:5 (2014), 17–22  mathnet  mathscinet
    2. V. A. Voblyi, “Enumeration of labeled connected graphs with given order and number of edges”, J. Appl. Industr. Math., 10:2 (2016), 302–310  mathnet  crossref  crossref  mathscinet  elib
  • Математические заметки Mathematical Notes
    Number of views:
    This page:255
    Full text:86
    References:39
    First page:12

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020