Hamiltonian Laceability in Some Classes of the Star Graphs.

Abstract

The graph G is Hamiltonian laceable [2] if there exists a Hamiltonian path between every pair of distinct vertices in it at an odd distance. G is Hamiltonian-t-laceable (t*-laceable) if there exists a Hamiltonian path in G between every pair (at least one pair) of vertices u and v in G with the property d(u,v)  t In this paper, we discuss the Hamiltonian laceability properties of the graphGv , where G is the Star graph , ( 3) 1, G  K n  n . We also explore the Hamiltonian Laceability properties of the subdivision graph  G