|
|
A189771
|
|
Number of simple graphs on n nodes that are Euler (all nodes even) but not Eulerian (single cycle passes through all edges).
|
|
0
|
|
|
0, 0, 0, 0, 0, 1, 2, 7, 20, 76, 334, 2498, 36398, 1225629, 89060804, 12978995815, 3646305137905, 1947685504386516, 1969840087225045340, 3770491704215436784514, 13674048211165798257589446, 94122727377410134768239226418
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,7
|
|
COMMENTS
|
There are more Euler graphs than Eulerian graphs since there exist disconnected graphs having multiple disjoint cycles with each node even but for which no single cycle passes through all edges.
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|