|
|
A052445
|
|
Number of simple unlabeled n-node graphs of connectivity 4.
|
|
10
|
|
|
0, 0, 0, 0, 1, 3, 21, 345, 13429, 1109105, 162318088, 39460518399
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The a(6) = 3 exactly-4-connected 6-node graphs are the complete graph K_6 with 1, 2, or 3 non-adjacent edges removed.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|