Hypo-edge-Hamiltonian Laceability in some classes of graphs

Abstract

If u and v are any two vertices in G such that d (u,v) = t and P a non-Hamiltonian path in G, for integer r, thenG is said to be  hypo-edge-Hamiltonian-t*-laceable if is a Hamiltonian path between u and v. If G is hypo-edge-Hamiltonian-t*-laceable for all t such  then G is termed hypo-t*-connected. In this paper, we discuss hypo-edge -Hamiltonian-t-Laceability of Banana tree,prism graph and Cyclo productCy (n , mk) of graphs.