Embeddings into the pancake interconnection network

The pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. Some good properties of this interconnection network include: vertex symmetry, small degree and diameter, extendability, and high connectivity (robustness). We present constant dilation embeddings of rings, grids, and hypercubes into the pancake. We also show that some of these embeddings lead to similar efficient embeddings into the star graph.