

A054596


Number of labeled minimally 2edgeconnected graphs by nodes.


3



1, 3, 37, 435, 6996, 134428, 3094785, 82061325, 2473950880, 83606473566, 3132506471139, 128918727009163, 5784184164416490, 281105943314654760, 14716271275161095761, 825944690635111256697, 49490362937885427672552
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

3,2


COMMENTS

The reference given here also contains the edge breakups foreach node given here.


REFERENCES

Sridar K. Pootheri, Counting classes of labeled 2connected graphs, M.S. Thesis, University of Georgia, 2000. (Under the direction of Robert W. Robinson, rwr(AT)cs.uga.edu)
Sridar K. Pootheri, Characterizing and counting classes of unlabeled 2connected graphs, Ph.D. Dissertation, University of Georgia, 2000. (Under the direction of Robert W. Robinson, rwr(AT)cs.uga.edu)


LINKS

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


CROSSREFS

Cf. A054317, A001072, A054595.
Sequence in context: A036942 A183960 A336242 * A155667 A216696 A333385
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



