Hamiltonian Laceability in Complete-k-Partite Graph

Abstract

A graph G is Hamiltonian laceable if there exists a Hamiltonian path between every pair of vertices in G at an odd distance. G is Hamiltonian - -laceable if there exists a Hamiltonian path between every pair of vertices  and with .In this paper we explore Hamiltonian- -laceabilityproperty inComplete-k-partite graph.