A New Formula for the Number of Labeled Series-Parallel Graphs

被引：0

作者：

Voblyi V.A. ^{[1
]}

机构：

[1] Russian Institute for Scientific and Technical Information, Moscow

来源：

Journal of Mathematical Sciences | 2023年 / 277卷 / 5期

关键词：

05C30; 2-connected graph; enumeration; explicit formula; labeled graph; series-parallel graph;

D O I：

10.1007/s10958-023-06877-1

中图分类号：

学科分类号：

摘要：

A series-parallel graph is a graph that does not contain a complete graph with four vertices as a minor. A new explicit simpler formula for the number of labeled series-parallel biconnected graphs with a given number of vertices is obtained. © 2023, Springer Nature Switzerland AG.

引用

页码：718 / 721

页数：3

共 7 条

[1]

Bodirsky M., Gimenez O., Kang M., Noy M., Enumeration and limit laws of series-parallel graphs, Eur. J. Combin., 28, 8, pp. 2091-2105, (2007)

[2]

Lavrentiev M.A., Shabat B.V., Methods of the Theory of Functions of a Complex Variable, (1965)

[3]

Radhavan S., Low-connectivity network design on series-parallel graphs, Networks, 43, 3, pp. 163-176, (2004)

[4]

Voblyi V.A., Second Riddell relation and its consequences, Diskr. Anal. Issled. Oper., 26, 1, pp. 20-32, (2019)

[5]

Voblyi V.A., Number of labeled series-parallel tetracyclic blocks, Prikl. Diskr. Mat., No., 47, pp. 57-61, (2020)

[6]

Voblyi V.A., Explicit formula for the number of labeled series-parallel k-cyclic blocks, Mat. Zametki, 108, 4, pp. 622-624, (2020)

[7]

Voblyi V.A., Meleshko A.M., On the number of labeled series-parallel tricyclic blocks, Proc. XV Int. Conf., pp. 168-170, (2018)

← 1 →