Hamiltonian-laceability of star graphs
Resource
Parallel Architectures, Algorithms, and Networks, 1997. (I-SPAN '97) Proceedings. Third International Symposium on
Journal
Third International Symposium on Parallel Architectures, Algorithms, and Networks
Pages
-
Date Issued
1997-12
Date
1997-12
Author(s)
DOI
N/A
Abstract
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/spl ges/4 is strongly hamiltonian-laceable.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00645079.pdf
Size
652.34 KB
Format
Adobe PDF
Checksum
(MD5):68a1a0c556c364c889bb9fd7f76fae31