A054597 Number of labeled 2-connected 3-edge-connected graphs by nodes.

1, 26, 1858, 236856, 53448752, 21492710960, 15580155490586, 20666523608722248, 50987290998908713436, 237747545131143536698656, 2125708373867783657045636502, 36886187089139407854559886683336

Offset

4,2

Comments

The reference given here also contains the edge breakups for each node given here.

Links

Table of n, a(n) for n=4..15.

S. K. Pootheri, Counting classes of labeled 2-connected graphs, M.S. Dissertation, University of Georgia, 2000.

S. K. Pootheri, Counting classes of labeled 2-connected graphs, M.S. Thesis, University of Georgia, 2000. [Local copy]

S. K. Pootheri, Characterizing and counting classes of unlabeled 2-connected graphs, Ph. D. Dissertation, University of Georgia, 2000.

S. K. Pootheri, Characterizing and counting classes of unlabeled 2-connected graphs, Ph. D. Dissertation, University of Georgia, 2000. [Local copy]

Crossrefs

Cf. A054316, A054853.

Cf. A005643.

Sequence in context: A005644 A123537 A220503 * A005643 A054853 A257947

Adjacent sequences: A054594 A054595 A054596 * A054598 A054599 A054600

Keyword

nice,nonn

Author

Sridar K. Pootheri (sridar(AT)math.uga.edu), Apr 14 2000

Status

approved