Laceability properties in edge tolerant corona product graphs

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. The corona product of G and H, denoted by GoH is obtained by taking one copy of G called the center graph, |V (G)| copies of H called the outer graph and taking the ith vertex of G adjacent to every vertex of the ith copy of H where 1 ≤ i ≤ |V (G)|. In this paper, we establish laceability properties in the edge tolerant corona product graph KnoPm.