Hyper hamiltonian laceability of Cayley graphs generated by transpositions

Suppose that G(V0 ∪V1,E) is a bipartite graph with partite sets of equal size. G is called hyper hamiltonian laceable if (1) it has a hamiltonian path between any pair of vertices in different partite sets, and (2) for any vertex v ∈ Vi, there is a hamiltonian path in G - v between any two vertices in V1 - i. Star and bubble-sort graphs have been considered as interconnection networks for parallel and distributed systems, and these graphs are known to be hyper hamiltonian laceable. Furthermore, it is well known that these graphs belong to the class of Cayley graphs on symmetric groups generated by a set of transpositions. In this article, we generalize those results by showing that any Cayley graph generated by transpositions is hyper hamiltonian laceable. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 48(3), 121–124 2006

[1]  Gen-Huey Chen,et al.  Hamiltonian‐laceability of star graphs , 2000 .

[2]  Shahram Latifi,et al.  Transposition Networks as a Class of Fault-Tolerant Robust Networks , 1996, IEEE Trans. Computers.

[3]  M. Lewinter,et al.  Hyper-Hamilton Laceable and Caterpillar-Spannable Product Graphs , 1997 .

[4]  Selim G. Akl,et al.  On Some Properties and Algorithms for the Star and Pancake Interconnection Networks , 1994, J. Parallel Distributed Comput..

[5]  Yasuto Suzuki,et al.  Node-to-node internally disjoint paths problem in bubble-sort graphs , 2004, 10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings..

[6]  Khaled Day,et al.  A Comparative Study of Topological Properties of Hypercubes and Star Graphs , 1994, IEEE Trans. Parallel Distributed Syst..

[7]  Shietung Peng,et al.  Node-To-Set Disjoint Paths Problem in Star Graphs , 1997, Inf. Process. Lett..

[8]  Marie-Claude Heydemann,et al.  Cayley graphs and interconnection networks , 1997 .

[9]  Dilip Sarkar,et al.  Optimal Broadcasting on the Star Graph , 1992, IEEE Trans. Parallel Distributed Syst..

[10]  S. Lakshmivarahan,et al.  Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: A Survey , 1993, Parallel Comput..

[11]  Jimmy J. M. Tan,et al.  Fault-tolerant hamiltonian laceability of hypercubes , 2002, Inf. Process. Lett..

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

[13]  Jimmy J. M. Tan,et al.  Hyper hamiltonian laceability on edge fault star graph , 2004, Inf. Sci..

[14]  Afonso Ferreira,et al.  Optimal information dissemination in Star and Pancake networks , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

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