LACEABILITY PROPERTIES IN IMAGE GRAPHS

A connected graph G is termed Hamiltonian-t-laceable (Hamiltonian-t*-laceable) if there exists in it a Hamiltonian path between every pair (at least one pair) of distinct vertices u and v with the property The image graph of a connected graph G, denoted by , is the graph obtained by joining the vertices of the original graph G to the corresponding vertices of a copy of G. In this paper, we explore laceability properties of the image graph of some classes of graphs.