-
\(n\)个节点的图,不一定连通,但每个连通块都是欧拉图:\(\large g_n = 2^{\binom{2}{n-1}}\)
-
\(n\)个节点的图,是连通欧拉图:\(\large f_n = g_n-\sum\limits_{i = 1}^{n-1}\left[f_i\cdot g_{n-i}\cdot \dbinom{i-1}{n-1}\right]\)
标签:连通,right,cdot,large,杂题,节点,欧拉
来源: https://www.cnblogs.com/bikuhiku/p/za.html