## LACEABILITY PROPERTIES IN THE IMAGE GRAPH OF PRISM GRAPHS

## LACEABILITY PROPERTIES IN THE IMAGE GRAPH OF PRISM GRAPHS

*P. Gomathi, R. Murali*

[**PDF**]

## Abstract

A connected graph G is termed Hamiltonian-t-laceable if there exists in it a Hamiltonian path between every pair of vertices u and v with the property d(u; v) = t , 1 t diam(G), where t is a positive integer. In this paper, we establish laceability properties in the image graph of Prism graph Im(Yn).

## Keywords

Hamiltonian graph, Hamiltonian laceable graph, Hamiltonian-t-laceable graph, Prism graph, Image graph.