

A054853


Number of labeled 3edgeconnected graphs by nodes.


2



1, 26, 1858, 236926, 53456032, 21493860332, 15580415345706, 20666613177952152, 50987341499153087708, 237747594646361178843768, 2125708461695379843278043006, 36886187376770375742178892122216
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

4,2


COMMENTS

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


LINKS

Table of n, a(n) for n=4..15.
S. K. Pootheri, Counting classes of labeled 2connected graphs, M.S. Dissertation, University of Georgia, 2000.
S. K. Pootheri, Counting classes of labeled 2connected graphs, M.S. Thesis, University of Georgia, 2000. [Local copy]
S. K. Pootheri, Characterizing and counting classes of unlabeled 2connected graphs, Ph. D. Dissertation, University of Georgia, 2000.
S. K. Pootheri, Characterizing and counting classes of unlabeled 2connected graphs, Ph. D. Dissertation, University of Georgia, 2000. [Local copy]


CROSSREFS

Cf. A054316, A038207, A257947.
Sequence in context: A220503 A054597 A005643 * A257947 A245929 A206390
Adjacent sequences: A054850 A054851 A054852 * A054854 A054855 A054856


KEYWORD

nice,nonn


AUTHOR

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


STATUS

approved



