摘要
Suppose G is a bipartite graph with two partite sets of equal size. G is said to be strongly hamiltonian-laceable if there is a hamiltonian path between every two vertices that belong to different partite sets, and there is a path of (maximal) length N-2 between every two vertices that belong to the same partite set, where N is the order of G. The star graph is known to be bipartite. In this paper, we show that the n-dimensional star graph, where n≥4 is strongly hamiltonian-laceable.
| 原文 | ???core.languages.en_GB??? |
|---|---|
| 頁面 | 112-117 |
| 頁數 | 6 |
| DOIs | |
| 出版狀態 | 已出版 - 1997 |
| 事件 | 3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997 - Taipei, Taiwan 持續時間: 18 12月 1997 → 20 12月 1997 |
???event.eventtypes.event.conference???
| ???event.eventtypes.event.conference??? | 3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997 |
|---|---|
| 國家/地區 | Taiwan |
| 城市 | Taipei |
| 期間 | 18/12/97 → 20/12/97 |