|
| |
|
|
A006290
|
|
Number of 3-connected graphs with n nodes.
(Formerly M3039)
|
|
5
|
|
|
|
1, 3, 17, 136, 2388, 80890, 5114079, 573273505, 113095167034, 39582550575765, 24908445793058442, 28560405143495819079, 60364410130177223014724, 237403933018799958309530349, 1750323137355778190158082029500, 24333358813699371350715221107464003, 640811613278752754485012443963579501421
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
4,2
|
|
|
COMMENTS
|
Robinson and Walsh list first 25 terms.
|
|
|
REFERENCES
|
R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
|
Table of n, a(n) for n=4..20.
R. W. Robinson, Tables
R. W. Robinson and T. R. S. Walsh, Inversion of cycle index sum relations for 2- and 3-connected graphs, J. Combin. Theory Ser. B. 57 (1993), 289-308.
T. R. S. Walsh, Counting unlabeled three-connected and homeomorphically irreducible two-connected graphs, J. Combin. Theory Ser. B 32 (1982), no. 1, 12-32.
Eric Weisstein's World of Mathematics, k-Connected Graph
David Kofoed Wind, Connected Graphs with Fewest Spanning Trees, Bachelor Thesis, Spring 2011.
|
|
|
CROSSREFS
|
Cf. A000088, A001349, A002218, A006289.
Sequence in context: A055214 A105630 A199138 * A060003 A231909 A286896
Adjacent sequences: A006287 A006288 A006289 * A006291 A006292 A006293
|
|
|
KEYWORD
|
nonn,nice,easy,changed
|
|
|
AUTHOR
|
N. J. A. Sloane
|
|
|
EXTENSIONS
|
More terms from R. C. Read (rcread(AT)math.uwaterloo.ca).
|
|
|
STATUS
|
approved
|
| |
|
|
