A289202 Number of maximum matchings in the n X n knight graph.

1, 1, 2, 16, 644, 10304, 65113608, 2849759680, 118928612871184, 58888109421793792

Offset: 1

Author

Eric W. Weisstein, Jun 28 2017

Keywords

• nonn
• more

Links

• Eric Weisstein's World of Mathematics, Independent Edge Set
• Eric Weisstein's World of Mathematics, Knight Graph
• Eric Weisstein's World of Mathematics, Matching
• Eric Weisstein's World of Mathematics, Maximum Independent Edge Set

Crossrefs

Cf. A287225, A289200.

Programs

Mathematica

Join[{1, 1}, Table[Length[With[{g = LineGraph[KnightTourGraph[n, n]]}, FindIndependentVertexSet[g, Length /@ FindIndependentVertexSet[g], All]]], {n, 3, 5}]]

Extensions

a(7)-a(10) from Andrew Howroyd, Jul 01 2017