RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., 2019 Volume 26, Issue 1, Pages 20–32 (Mi da915)

This article is cited in 21 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.

UDC: 519.175.3

Received: 03.04.2018
Revised: 01.10.2018
Accepted: 28.11.2018

DOI: 10.33048/daio.2019.26.615


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

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025