Hamiltonian Laceability in Middle Graph of Cubic Graph (Gc)2n and (W1,n, k) Graphs
G. P. Manjunath, R. Murali · International Journal in IT & Engineering · 2015
A simple connected graph G is Hamiltonian laceable if there exists a Hamiltonian path between every pair of distinct vertices at an odd distance in it. 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, 1≤r≤diam G. In this paper we explore the Hamiltonian laceability properties of the Middle graph of the Cubic Graphn (Gc)2n and the (W1,n, k) graph for k=1.