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., 2019, Volume 26, Number 1, Pages 20–32 (Mi da915)  

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

The second Riddel relation and its consequences

V. A. Voblyi

All-Russian Institute for Scientific and Technical Information RAS, 20 Usievicha St., 125190 Moscow, Russia

Abstract: The second Riddell relation relates the generating functions for the number of labeled connected graphs and the number of labeled blocks. We consider the conditions under which this relation is true for a subclass of connected graphs. Under these conditions, the formulas are valid that express the number of graphs from a subclass of labeled connected graphs trough the generating function of their blocks. By way of application, we obtain expressions for the numbers of labeled connected and 2-connected series-parallel graphs. Bibliogr. 22.

Keywords: enumeration, labeled graph, connected graph, 2-connected graph, generating function, block-stable class, series-parallel graph.

DOI: https://doi.org/10.33048/daio.2019.26.615

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

English version:
Journal of Applied and Industrial Mathematics, 2019, 13:1, 168–174

UDC: 519.175.3
Received: 03.04.2018
Revised: 01.10.2018
Accepted:28.11.2018

Citation: V. A. Voblyi, “The second Riddel relation and its consequences”, Diskretn. Anal. Issled. Oper., 26:1 (2019), 20–32; J. Appl. Industr. Math., 13:1 (2019), 168–174

Citation in format AMSBIB
\Bibitem{Vob19}
\by V.~A.~Voblyi
\paper The second Riddel relation and its consequences
\jour Diskretn. Anal. Issled. Oper.
\yr 2019
\vol 26
\issue 1
\pages 20--32
\mathnet{http://mi.mathnet.ru/da915}
\crossref{https://doi.org/10.33048/daio.2019.26.615}
\transl
\jour J. Appl. Industr. Math.
\yr 2019
\vol 13
\issue 1
\pages 168--174
\crossref{https://doi.org/10.1134/S1990478919010174}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85064887992}


Linking options:
  • http://mi.mathnet.ru/eng/da915
  • http://mi.mathnet.ru/eng/da/v26/i1/p20

    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, “On the number of labeled outerplanar $k$-cyclic bridgeless graphs”, J. Appl. Industr. Math., 14:1 (2020), 205–211  mathnet  crossref  crossref
    2. V. A. Voblyi, “Chislo pomechennykh tetratsiklicheskikh posledovatelno-parallelnykh blokov”, PDM, 2020, no. 47, 57–61  mathnet  crossref
    3. V. A. Voblyi, “Perechislenie pomechennykh posledovatelno-parallelnykh tritsiklicheskikh grafov”, Algebra, Itogi nauki i tekhn. Ser. Sovrem. mat. i ee pril. Temat. obz., 177, VINITI RAN, M., 2020, 132–136  mathnet  crossref
    4. V. A. Voblyi, “An Explicit Formula for the Number of Labeled Series-Parallel $k$-Cyclic Blocks”, Math. Notes, 108:4 (2020), 608–610  mathnet  crossref  crossref
  • Дискретный анализ и исследование операций
    Number of views:
    This page:115
    Full text:5
    References:16
    First page:5

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