|
Search: id:A054316
|
|
|
| A054316 |
|
Number of unlabeled 2-connected 3-edge-connected graphs with n nodes. |
|
+0
5
|
|
| 1, 3, 19, 149, 2578, 84127, 5201474, 577043450, 113371887160, 39618007594177, 24916462201698733, 28563626901315427552, 60366734333061918085970, 237406975833857522512566844, 1750330441805919888169149998870
(list; graph; listen)
|
|
|
OFFSET
|
4,2
|
|
|
REFERENCES
|
Sridar K. Pootheri, Characterizing and counting classes of unlabeled 2-connected graphs, Ph.D. Dissertation, University of Georgia. (Under the direction of Prof. Robert W. Robinson, rwr(AT)cs.uga.edu)
|
|
CROSSREFS
|
Cf. A054317, A003317.
Sequence in context: A005258 A131551 A074546 this_sequence A006289 A120590 A007112
Adjacent sequences: A054313 A054314 A054315 this_sequence A054317 A054318 A054319
|
|
KEYWORD
|
hard,nice,nonn
|
|
AUTHOR
|
Sridar K. Pootheri (sridar(AT)math.uga.edu), Feb 25 2000
|
|
|
Search completed in 0.002 seconds
|
