Hamiltonian-T*- Laceability in Jump Graphs Of Diameter Two
G. P. Manjunath, R. Murali · IOSR Journal of Mathematics · 2014
Let G be the nonempty graph.The Jump graph J [G] of G is the graph whose vertices are edges of G, and where two vertices of J [G] are adjecent if and only if they are not adjacent in G, equivalently , the Jump graph J[G] is the complément of line graph L [G].In [2] the authors have obtained Hamiltonian Jump graphs.In this paper we charecterised Hamiltonian laceability of Jump graph and also explore the Laceability in jump graph of Star, Friendship and Ladder graphs.