Hamiltonian jump graphs Original Research Article

Let G be a nonempty graph. The jump graph image of G is the graph whose vertices are edges of G, and where two vertices of image are adjacent if and only if they are not adjacent in G. Equivalently, the jump graph image of G is the complement of line graph image of G. In this paper, we characterize hamiltonian jump graphs and settle two conjectures posed by Chartrand et al. on jump graphs.