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

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


Diskretn. Anal. Issled. Oper., 2014, Volume 21, Number 2, Pages 24–32 (Mi da764)  

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

The number of labeled block-cactus graphs

V. A. Voblyi, A. K. Meleshko

Bauman Moscow State Technical University, 5 2nd Bauman St., 119333 Moscow, Russia

Abstract: We obtain exact and asymptotical formulas for the number of block-cactus graphs and eulerian block-cactus graphs with the given number of vertices. Tab. 1, bibliogr. 15.

Keywords: enumeration, block graph, cactus, block-cactus graph, asymptotics.

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

English version:
Journal of Applied and Industrial Mathematics, 2014, 8:3, 422–427

Bibliographic databases:

UDC: 519.175.3
Received: 22.07.2013

Citation: V. A. Voblyi, A. K. Meleshko, “The number of labeled block-cactus graphs”, Diskretn. Anal. Issled. Oper., 21:2 (2014), 24–32; J. Appl. Industr. Math., 8:3 (2014), 422–427

Citation in format AMSBIB
\Bibitem{VobMel14}
\by V.~A.~Voblyi, A.~K.~Meleshko
\paper The number of labeled block-cactus graphs
\jour Diskretn. Anal. Issled. Oper.
\yr 2014
\vol 21
\issue 2
\pages 24--32
\mathnet{http://mi.mathnet.ru/da764}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3241785}
\transl
\jour J. Appl. Industr. Math.
\yr 2014
\vol 8
\issue 3
\pages 422--427
\crossref{https://doi.org/10.1134/S1990478914030156}


Linking options:
  • http://mi.mathnet.ru/eng/da764
  • http://mi.mathnet.ru/eng/da/v21/i2/p24

    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
    Erratum

    This publication is cited in the following articles:
    1. 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
    2. V. A. Voblyi, “Vtoroe sootnoshenie Riddela i sledstviya iz nego”, Diskretn. analiz i issled. oper., 26:1 (2019), 20–32  mathnet  crossref
  • Дискретный анализ и исследование операций
    Number of views:
    This page:216
    Full text:65
    References:49
    First page:10

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