|
|
A372191
|
|
Number of unlabeled simple graphs covering n vertices with a unique undirected cycle of length > 2.
|
|
16
|
|
|
0, 0, 0, 1, 2, 6, 16, 43, 117, 319, 875, 2409, 6692, 18614, 52099, 146186, 411720, 1162295, 3289994, 9330913, 26517036, 75481622, 215201178, 614398459, 1756392061, 5026955216, 14403488345, 41311616835, 118601561506, 340795908579, 980078195995
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,5
|
|
COMMENTS
|
An undirected cycle in a graph is a sequence of distinct vertices, up to rotation and reversal, such that there are edges between all consecutive elements, including the last and the first.
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
A002807 counts cycles in a complete graph.
A372176 counts labeled graphs by directed cycles.
|
|
KEYWORD
|
nonn,changed
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|