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., 2012, Volume 19, Number 4, Pages 48–59 (Mi da696)  

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

A formula for the number of labeled connected graphs

V. A. Voblyi

Moscow State Technologic University, Moscow, Russia

Abstract: We propose a new formula for the number of labeled connected graphs in terms of the generating function of their blocks. We apply this formula to cacti and outer-planar graphs. Bibliogr. 13.

Keywords: enumeration, connected graph, block, cactus, outer-planar graph.

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

Bibliographic databases:
UDC: 519.175.3
Received: 25.09.2011

Citation: V. A. Voblyi, “A formula for the number of labeled connected graphs”, Diskretn. Anal. Issled. Oper., 19:4 (2012), 48–59

Citation in format AMSBIB
\Bibitem{Vob12}
\by V.~A.~Voblyi
\paper A formula for the number of labeled connected graphs
\jour Diskretn. Anal. Issled. Oper.
\yr 2012
\vol 19
\issue 4
\pages 48--59
\mathnet{http://mi.mathnet.ru/da696}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3013542}


Linking options:
  • http://mi.mathnet.ru/eng/da696
  • http://mi.mathnet.ru/eng/da/v19/i4/p48

    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, “The number of labeled block-cactus graphs”, J. Appl. Industr. Math., 8:3 (2014), 422–427  mathnet  crossref  mathscinet
    2. A. V. Seliverstov, “Mnogogranniki i svyaznye podgrafy”, Diskretn. analiz i issled. oper., 21:3 (2014), 82–86  mathnet  mathscinet
    3. V. A. Voblyi, “Enumeration of Labeled Geodetic Planar Graphs”, Math. Notes, 97:3 (2015), 321–325  mathnet  crossref  crossref  mathscinet  zmath  isi  elib
    4. 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
    5. V. A. Voblyi, A. K. Meleshko, “Enumeration of labeled outerplanar bicyclic and tricyclic graphs”, J. Appl. Industr. Math., 11:2 (2017), 296–303  mathnet  crossref  crossref  elib
    6. V. A. Voblyi, “The Number of Labeled Outerplanar $k$-Cyclic Graphs”, Math. Notes, 103:5 (2018), 694–702  mathnet  crossref  crossref  isi  elib
    7. V. A. Voblyi, “The second Riddel relation and its consequences”, J. Appl. Industr. Math., 13:1 (2019), 168–174  mathnet  crossref  crossref
  • Дискретный анализ и исследование операций
    Number of views:
    This page:342
    Full text:100
    References:40
    First page:10

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