|
|
A338511
|
|
Number of unlabeled 3-connected graphs with n edges.
|
|
16
|
|
|
1, 0, 1, 3, 4, 7, 22, 51, 152, 501, 1739, 6548, 26260, 110292, 483545, 2198726, 10327116, 49965520, 248481062, 1267987437, 6630660484, 35492360163, 194283212876
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
6,4
|
|
COMMENTS
|
The smallest 3-connected graph is the complete graph on 4 vertices which has 6 edges.
|
|
LINKS
|
|
|
PROG
|
(PARI) \\ It is assumed that the 3cc.gp file (from the linked zip archive) has been read before, i.e., \r [path]3cc.gp
for(k=1, #ThreeConnectedData, print1(#ThreeConnectedData[k], ", "));
\\ printing of the graphs for n <= 9
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(17)-a(25) from Hugo Pfoertner using data from Robinson's tables, Nov 20 2020
a(26)-a(28) from Andrew Howroyd using data from Robinson's tables, Nov 24 2020
|
|
STATUS
|
approved
|
|
|
|