On the Embedding of Cycles in Pancake Graphs
In recent times the use of star and pancake networks as a viable interconnection scheme for parallel computers has been examined by a number of researchers. An attractive feature of these two classes of graphs is that they have sublogarithmic diameter and have a great deal of symmetry akin to the binary hypercube. In this paper we describe new algorithms for embedding: (a) Hamiltonian cycles along with ranking and unranking algorithms with respect to them, and (b) The set of cycles. The analogous problems for star graphs has been solved recently .
(1995). On the Embedding of Cycles in Pancake Graphs. Parallel Computing, 21(6), 923-936.
Available at: https://aquila.usm.edu/fac_pubs/5861