Abstract
AbstractSuppose 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
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
