|
|
A133736
|
|
Number of graphs on n unlabeled nodes that have an Eulerian cycle, i.e., a cycle that goes through every edge in the graph exactly once.
|
|
3
|
|
|
1, 1, 2, 3, 7, 15, 52, 236, 2018, 33044, 1181670, 87720798, 12886156666, 3633055848955, 1944000061673516, 1967881435350411681, 3768516013573481061951, 13670271805989797561408684
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Any such graph consists of a single connected Euler graph (see A003049) plus a number of isolated vertices.
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|