LACEABILITY PROPERTIES IN PRISM GRAPHS
A connected graph G is termed hamiltonian-t-laceable if there exists in it a hamiltonian path between every pair of distinct vertices u and v with the property where t is a positive integer. In this paper, we show that the prism graph for all is hamiltonian laceable.
hamiltonian graph, hamiltonian laceable graph, hamiltonian-t-laceable graph, hamiltonian-t*-laceable graph, prism graph.
