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

1, 3, 37, 435, 6996, 134428, 3094785, 82061325, 2473950880, 83606473566, 3132506471139, 128918727009163, 5784184164416490, 281105943314654760, 14716271275161095761, 825944690635111256697, 49490362937885427672552

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, A054595.

Sequence in context: A338717 A346952 A336242 * A155667 A216696 A362724

Adjacent sequences: A054593 A054594 A054595 * A054597 A054598 A054599

Keyword

nice,nonn

Author

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

Status

approved