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.
Fulltext:
PDF file (162 kB)