| Autor: |
Murali, R., Harinath, K. S. |
| Zdroj: |
Journal of Discrete Mathematical Sciences and Cryptography; April 2001, Vol. 4 Issue: 1 p77-86, 10p |
| Abstrakt: |
AbstractA graph Gis hamiltonian laceable if there exists a hamiltonian path between every pair of vertices at an odd distance in G.Further, Gis hamiltonianr-n-laceable if there exists a hamiltonian path between every pair of vertices at distance nin G, and hamiltonian-n*-Maceable if there exists at least one such pair where nis 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 nwith specified distance sets. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
