|
|
A289200
|
|
Number of maximal matchings in the n X n knight graph.
|
|
3
|
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Matching
|
|
MATHEMATICA
|
Table[Length[FindIndependentVertexSet[LineGraph[KnightTourGraph[n, n]], Infinity, All]], {n, 5}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|