A289200 Number of maximal matchings in the n X n knight graph.
1, 1, 10, 538, 94868, 59059198
Offset: 1
Links
- Eric Weisstein's World of Mathematics, Knight Graph
- Eric Weisstein's World of Mathematics, Matching
- Eric Weisstein's World of Mathematics, Maximal Independent Edge Set
Programs
-
Mathematica
Table[Length[FindIndependentVertexSet[LineGraph[KnightTourGraph[n, n]], Infinity, All]], {n, 5}]
Extensions
a(6) from Eric W. Weisstein, Jun 02 2019