|
Search: id:A054317
|
|
|
| A054317 |
|
Number of unlabeled 2-connected minimally 2-edge-connected graphs with n nodes. |
|
+0
5
|
|
| 1, 1, 2, 3, 5, 10, 19, 42, 92, 225, 564, 1501, 4127, 11809, 34713, 104904, 323778, 1019538, 3265502, 10624881, 35065697, 117289911, 397290416, 1362060455, 4724272231, 16572501190, 58782486855, 210782826628, 763991002957
(list; graph; listen)
|
|
|
OFFSET
|
3,3
|
|
|
COMMENT
|
Reference also contains the edge breakups for each term.
|
|
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. A054316, A003317, A001072.
Adjacent sequences: A054314 A054315 A054316 this_sequence A054318 A054319 A054320
Sequence in context: A046630 A064236 A007569 this_sequence A065840 A093785 A105369
|
|
KEYWORD
|
hard,nice,nonn
|
|
AUTHOR
|
Sridar K. Pootheri (sridar(AT)math.uga.edu), Feb 25 2000
|
|
|
Search completed in 0.002 seconds
|
