# Laceability in the Image Graph of Some Classes of Graphs

A affiliated graph G is dubbed Hamiltonian-t-laceable (Hamiltonian-t*-laceable) if there lives in it a Hamiltonian path ‘tween every pair (not completely one pair) of unconnected vertices u and v accompanying the property d(u,v) = ≤ t ≥ , 1 t diamG. In [1] the authors Vaidya and Bijukumar delineated the joint sum of the phase Cn as follows. Consider two copies of Cn, combine a vertex of the first copy to a top of the second copy with a new edge. The new diagram obtained is named joint sum of Cn . Another type of diagram called the double diagram of a graph is built by taking two copies of G and adjoining edges u1v2 and v2u1 for every edge uv of G. The concept graph of a affiliated graph G, meant by Img (G) , is the graph acquired by joining the top of the original graph G to the matching top of a copy of G. We investigate the laceability characteristics of the image diagram of some classes of graphs in this place chapter.

**Author(s) Details:**

M. S. Annapoorna,

Department of Mathematics, BMS Institute of Technology and Management, Bengaluru, India.

**R. Murali,
**Department of Mathematics, Dr. Ambedkar Institute of Technology, Bengaluru, India.

**Please see the link here: **https://stm.bookpi.org/RHMCS-V6/article/view/9803

**Keywords: **Hamiltonian path, Hamiltonian-t*-laceable graph, mage graphi