Hypo-edge-Hamiltonian laceability in Graphs

Abstract

A simple connected graph is known to be Hamiltonian-t-laceable if there will be a Hamiltonian path between each pair of distinct vertices at a distance ‘t’ in G where t ∈ Z + such that 1 ≤ t ≤ diam(G). In this paper we define M-flower snark graph and discuss the hypo edge Hamiltonian laceability properties in M-flower snark graphs and Cartesian product graphs.