Hamiltonian Laceability in Cyclic Product and Brick Product of Cycles.

Abstract

A connected graph G is said to be Hamiltonian-t-laceable if there exists a Hamiltonian path between every pair of distinct vertices at a distance‘t’ in G and Hamiltonian-t*-laceable if there exist at least one such pair, where t is a positive integer. In this paper we explore Hamiltonian-t*- Laceability properties of the cyclic product C(2n, m) and the Brick product C(2n+1, 3, 2) of cycles.