login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A241703
Number of simple unlabeled n-node graphs of edge-connectivity 4.
6
0, 0, 0, 0, 1, 3, 25, 378, 14306, 1141575, 164245876, 39637942895
OFFSET
1,6
LINKS
Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
Jens M. Schmidt, Combinatorial data.
Eric Weisstein's World of Mathematics, k-Edge Connected Graph.
CROSSREFS
Column k=4 of A263296.
Cf. other edge-connectivity unlabeled graph sequences A052446, A052447, A052448, A241704, A241705.
Sequence in context: A295765 A012481 A132617 * A251569 A319122 A304858
KEYWORD
nonn,hard,more
AUTHOR
Travis Hoppe and Anna Petrone, Apr 27 2014
EXTENSIONS
a(11) by Jens M. Schmidt, Feb 18 2019
a(12) from Jens M. Schmidt's web page, Jan 10 2021
STATUS
approved