|
| |
|
|
A054853
|
|
Number of labeled 3-edge-connected graphs by nodes.
|
|
1
| |
|
|
1, 26, 1858, 236926, 53456032, 21493860332, 15580415345706, 20666613177952152, 50987341499153087708, 237747594646361178843768, 2125708461695379843278043006, 36886187376770375742178892122216
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 4,2
|
|
|
COMMENTS
| The reference given here also contains the edge breakups foreach node given here.
|
|
|
REFERENCES
| Sridar K. Pootheri, Counting classes of labeled 2-connected 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 2-connected graphs, Ph.D. Dissertation, University of Georgia, 2000. (Under the direction of Robert W. Robinson, rwr(AT)cs.uga.edu)
|
|
|
CROSSREFS
| Cf. A054316, A038207.
Sequence in context: A123537 A054597 A005643 * A206390 A173949 A173955
Adjacent sequences: A054850 A054851 A054852 * A054854 A054855 A054856
|
|
|
KEYWORD
| nice,nonn
|
|
|
AUTHOR
| Sridar K. Pootheri (sridar(AT)math.uga.edu), Apr 14 2000
|
| |
|
|
