## Laceability in the Image Graph of Some Classes of Graphs

A related 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 obvious vertices u and v accompanying the property d(u,v) = ≤ t ≥ , 1 t diamG. In [1] the authors Vaidya and Bijukumar delimited...

Read More