Hamiltonian-laceability of star graphs

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.

[1]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[2]  S. Lakshmivarahan,et al.  Embedding of cycles and grids in star graphs , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[3]  Yu-Chee Tseng,et al.  Fault-tolerant ring embedding in star graphs , 1996, Proceedings of International Conference on Parallel Processing.

[4]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[5]  Stephen A. Wong.  Hamilton cycles and paths in butterfly graphs , 1995, Networks.