LACEABILITY PROPERTIES IN FLOWER SNARK GRAPHS
A connected graph G is said to be Hamiltonian-t-laceable [2] if there exists a Hamiltonian path between every pair of distinct vertices at a distance ‘t’ in G and Hamiltonian--laceable if there exist at least one such pair, where t is a positive integer such that A non-Hamiltonian graph is hypo-Hamiltonian [3] if is Hamiltonian for any If u and v are any two vertices in G such that and P is a non-Hamiltonian path in G, then G is said to be hypoedge-Hamiltonian--laceable if “” is a Hamiltonian path between u and v. If G is hypoedge-Hamiltonian--laceable for all t such that then G is termed hypo--connected. In this paper, we discuss hypoedge-Hamiltonian laceability of flower snark graphs.
hypo-Hamiltonian, Hamiltonian-t*-laceable graph, K+r-hypoedge-Hamiltonian.