A218463 Number of simple connected perfect matching graphs on 2n nodes.

1, 5, 95, 10297, 11546911

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, Connected Graph
• Eric Weisstein's World of Mathematics, Perfect Matching

Crossrefs

Cf. A218462 (not-necessarily-connected simple perfect matching graphs).

Cf. A287652 (disconnected simple perfect matching graphs).

Formula

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

Inverse Euler transform of A218462. - Andrew Howroyd, Nov 03 2017