A054595 Number of labeled 2-connected minimally 2-edge-connected graphs by nodes.

1, 3, 22, 255, 3321, 52948, 1064988, 25071525, 667694395, 20114706546, 678833013618, 25302305856919, 1033146095157645, 45956558123679960, 2213869047416018296, 114892917344393371209, 6396625360877830999983

Offset

3,2

Comments

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

Links

Table of n, a(n) for n=3..19.

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. A054317, A001072, A054596.

Sequence in context: A367845 A361097 A143634 * A054594 A242794 A367181

Adjacent sequences: A054592 A054593 A054594 * A054596 A054597 A054598

Keyword

nice,nonn

Author

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

Status

approved