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, 2014, Volume 21, Issue 5, Pages 17–22 (Mi da790)  
This article is cited in 1 scientific paper (total in 1 paper)

Enumeration of labeled Eulerian tetracyclic graphs

V. A. Voblyi, A. K. Meleshko

Bauman Moscow State Technical University, 5 2nd Bauman St., 119333 Moscow, Russia
Full-text PDF (233 kB) Citations (1)
References:
PDF
HTML
Abstract: We deduce the exact and asymptotical formulas for the number of labeled Eulerian tetracyclic graphs. Ill. 1, tab. 1, bibliogr. 11.
Keywords: enumeration, labeled graph, Eulerian graph, tetracyclic graph, asymptotics.
Received: 29.04.2014
Revised: 24.06.2014
Bibliographic databases:
Document Type: Article
UDC: 519.175.3
Language: Russian
Citation: V. A. Voblyi, A. K. Meleshko, “Enumeration of labeled Eulerian tetracyclic graphs”, Diskretn. Anal. Issled. Oper., 21:5 (2014), 17–22
Citation in format AMSBIB
\Bibitem{VobMel14}
\by V.~A.~Voblyi, A.~K.~Meleshko
\paper Enumeration of labeled Eulerian tetracyclic graphs
\jour Diskretn. Anal. Issled. Oper.
\yr 2014
\vol 21
\issue 5
\pages 17--22
\mathnet{http://mi.mathnet.ru/da790}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3328834}
Linking options:
  • https://www.mathnet.ru/eng/da790
  • https://www.mathnet.ru/eng/da/v21/i5/p17
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:330
    Full-text PDF :138
    References:63
    First page:6
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024