A222199 Number of Hamiltonian cycles in the graph C_n X C_n.

48, 1344, 23580, 3273360, 257165468, 171785923808, 61997157648756, 196554899918485160

Offset: 3

Author

N. J. A. Sloane, Feb 14 2013

Keywords

• nonn
• hard
• more

Comments

C_n X C_n is also known as the (n,n)-torus grid graph.

Links

• Artem M. Karavaev, Hamilton Cycles.
• Eric Weisstein's World of Mathematics, Hamiltonian Cycle.
• Eric Weisstein's World of Mathematics, Torus Grid Graph.

Crossrefs

Cf. A270273, A003763, A222197, A268838, A222198, A193153, A270247.

Programs

Mathematica

Table[Length[FindHamiltonianCycle[GraphProduct[CycleGraph[n], CycleGraph[n], "Cartesian"], All]], {n, 3, 6}] (* Eric W. Weisstein, Dec 16 2023 *)