International Journal in IT & Engineering
  • Year: 2015
  • Volume: 3
  • Issue: 2

Hamiltonian Laceability in Middle Graph of Cubic Graph (Gc)2n and (W1,n, k) Graphs

  • Author:
  • G. Manjunath1, R. Murali2
  • Total Page Count: 17
  • Page Number: 133 to 149

1Research scholar, Dr. Ambedkar Institute of Technology, Bangalore

2Department of Mathematics, Dr. Ambedkar Institute of Technology, Bangalore

Online published on 27 July, 2015.

Abstract

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.

Keywords

Connected graph, Middle graph, Hamiltonian-t-laceable graph, Hamiltonian-t*-laceable graph, t-laceability number