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.
|Number of pages||6|
|State||Published - 1997|
|Event||3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997 - Taipei, Taiwan|
Duration: 18 Dec 1997 → 20 Dec 1997
|Conference||3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997|
|Period||18/12/97 → 20/12/97|