Let G be a 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 adjacent if and only if they are not adjacent in G. Equivalently, the jump graph J(G) of G is the complement of line graph L(G) of G. In this paper, we characterize hamiltonian jump graphs and settle two conjectures posed by Chartrand et al. on jump graphs. © 2004 Elsevier B.V. All rights reserved.
Wu, B., & Meng, J. (2004). Hamiltonian jump graphs. Discrete Mathematics, 289(1–3), 95–106. https://doi.org/10.1016/j.disc.2004.09.003