A218462 Number of simple perfect matching graphs on 2n nodes.

1, 6, 101, 10413, 11557799

Offset: 1

Author

Eric W. Weisstein, Mar 26 2013

Keywords

• nonn
• more

Comments

Perfect matchings exist only for graphs with an even number of nodes.

Links

• Eric Weisstein's World of Mathematics, Perfect Matching

Crossrefs

Cf. A218463 (connected simple perfect matching graphs).

Cf. A287652 (disconnected simple perfect matching graphs).

Cf. A286951.

Formula

a(n) = A218463(n) + A287652(n). - Eric W. Weisstein, May 29 2017

a(n) = A286951(2*n, n). - Andrew Howroyd, Sep 05 2019