|
This article is cited in 2 scientific papers (total in 2 papers)
Two combinatorial identities related to enumeration of graphs
V. A. Voblyi All-Russian Institute for Scientific and Technical Information of Russian Academy of Sciences, Moscow
Abstract:
From the explicit formula for the number of labeled, series-parallel, $2$-connected graphs with a given number of vertices obtained by the author, two combinatorial identities are derived. Also, proofs of these identities independent of the enumeration of graphs are given.
Keywords:
combinatorial identity, method of coefficients, enumeration, series-parallel graph, 2-connected graph.
Citation:
V. A. Voblyi, “Two combinatorial identities related to enumeration of graphs”, Proceedings of the Voronezh International Spring Mathematical School "Modern Methods of the Theory of Boundary-Value Problems. Pontryagin Readings – XXXII”, Voronezh, May 3–9, 2021, Part 1, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 208, VINITI, Moscow, 2022, 11–14
Linking options:
https://www.mathnet.ru/eng/into989 https://www.mathnet.ru/eng/into/v208/p11
|
| Statistics & downloads: |
| Abstract page: | 196 | | Full-text PDF : | 84 | | References: | 57 |
|