|
Search: id:A003317
|
|
|
| A003317 |
|
Number of unlabeled minimally 2-connected graphs with n nodes (also called "blocks").
(Formerly M0799)
|
|
+0
4
|
|
| 1, 1, 2, 3, 6, 12, 28, 68, 184, 526, 1602, 5075, 16711, 56428, 195003, 685649, 2447882, 8850157, 32359428, 119492766, 445236635, 1672636369, 6331624545, 24138404479, 92640942148, 357805122286, 1390318899884, 5433781135206
(list; graph; listen)
|
|
|
OFFSET
|
3,3
|
|
|
COMMENT
|
Pootheri reference also contains the edge breakups for each term.
|
|
REFERENCES
|
A. M. Hobbs, A catalog of minimal blocks, J. Res. National Bureau Standards, B 77 (1973), 53-60.
Hu, Guan Zhang; Liu, Guo Qing; Liu, Shi; He, Jian Ping; Enumeration of minimally $2$-connected graphs by means of group theory. (Chinese) Acta Math. Appl. Sinica 12 (1989), no. 2, 164-173.
S. 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, A054317, A002218.
Sequence in context: A122889 A014280 A073431 this_sequence A014278 A060777 A089430
Adjacent sequences: A003314 A003315 A003316 this_sequence A003318 A003319 A003320
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Sridar K. Pootheri (sridar(AT)math.uga.edu), Feb 25 2000
|
|
|
Search completed in 0.002 seconds
|
