|
|
A241705
|
|
Number of simple unlabeled n-node graphs of edge-connectivity 6.
|
|
6
|
|
|
0, 0, 0, 0, 0, 0, 1, 4, 65, 3441, 857365, 487560158, 466534106494
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,8
|
|
LINKS
|
Table of n, a(n) for n=1..13.
Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
Jens M. Schmidt, Data files in graph6 format
T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
Eric Weisstein's World of Mathematics, k-Edge Connected Graph.
|
|
CROSSREFS
|
Column k=6 of A263296.
Cf. other edge-connectivity unlabeled graph sequences A052446, A052447, A052448, A241703, A241704.
Sequence in context: A307185 A206500 A266520 * A015475 A197947 A220798
Adjacent sequences: A241702 A241703 A241704 * A241706 A241707 A241708
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
Travis Hoppe and Anna Petrone, Apr 27 2014
|
|
EXTENSIONS
|
a(11)-a(13) by Jens M. Schmidt, Feb 20 2019
|
|
STATUS
|
approved
|
|
|
|