Laceability and distance graphs
R. Murali, K. S. Harinath · Journal of Discrete Mathematical Sciences and Cryptography · 2001
A graph G is hamiltonian laceable if there exists a hamiltonian path between every pair of vertices at an odd distance in G. Further, G is hamiltonianr-n-laceable if there exists a hamiltonian path between every pair of vertices at distance n in G, and hamiltonian-n*-Maceable if there exists at least one such pair where n is a positive integer. In this paper, we define distance laceable graphs using the concept of distance graphs and obtain laceability properties of distance graphs associated with a path of order n with specified distance sets.