Hamiltonian Laceability in Ring Product and Cyclo Product of Graphs

Abstract

B. Alspach, C.C. Chen and Kevin Mc Avaney [1] have discussed the Hamiltonian laceability of the Brick product C(2n,m, r) for even cycles. In [2], the authors have shown that the (m, r)Brick Product C(2n + 1, 1, 2) is Hamiltonian-t-laceable for 1 ≤ t ≤ diamn. In [3] the authors have defined and discussed Hamiltonian-t-laceability properties of cyclic product C(2n,m) cyclic product of graphs. In this paper we explore Hamiltonian-t∗-laceability of (W1,n, k) graph and Cyclo Product Cy(n,mk) of graph.