In a recent paper, we have studied the enumeration of Hamiltonian cycles (abbreviated HCs) on the grid cylinder graph Pm+1 x Cn, where m grows while n is fixed. In this sequel, we study a much harder problem of enumerating HCs on the same graph only this time letting n grow while m is fixed. We propose a characterization for non-contractible HCs which enables us to prove that their numbers hnc, m (n) satisfy a recurrence relation for every fixed m. From the computational data, we conjecture that the coefficient for the dominant positive characteristic root in the explicit formula for hnc,m (n) is 1.
Here, in Part II, we proceeded further with the enumeration of Hamiltonian cycles (HC's) on the grid cylinder graphs of the form Pm+1?Cn, where n is allowed to grow and m is fixed. We proposed two novel characterisations of the contractible HC's. Finally, we made a conjecture concerning the dependency of the asymptotically dominant type of HC's on the parity of m.
25 November 2011 in Acta Mathematica Sinica, English Series
Many integrals require two successive applications of integration by parts. During the process, another integral of similar type is often invoked. We propose a method which can integrate these two integrals simultaneously. All we need is to solve a linear system of equations.