+91 8617752708

British Journal of Mathematics & Computer Science, ISSN: 2231-0851,Vol.: 2, Issue.: 1 (January-March)

Original Research Article

Embedding n-Dimensional Crossed Hypercube into Pancake Graphs


M. F. Zerarka1, S. Femmam2* and R. Aschheim3
1Polytechnic Engineers School Labs E.P.F. 3 bis street Lakanal, 92330 Sceaux, France.
2Polytechnic Engineers School Labs E.P.F. 3 bis street Lakanal, 92330 Sceaux, France & University of UHA France.
3Polytopics Research Institute, 8 villa Haussmann, 92130 Issy, France.


Among Cayley graphs on the symmetric group, the pancake graph is one as a viable interconnection scheme for parallel computers, which has been examined by a number of researchers. The pancake was proposed as alternatives to the hypercube for interconnecting processors in parallel computers. Some good and attractive properties of this interconnection network include: vertex symmetry, small degree, a sub-logarithmic diameter, extendability, and high connectivity (robustness), easy routing, and regularity of topology, fault tolerance, extensibility and embeddability of other topologies. In this paper, we present the many-to-one dilation 5 embedding of n-dimensional crossed hypercube into n-dimensional pancake patients. These predictors, however, need further work to validate reliability.

Keywords :

Cayley graph; embedding, crossed hypercube networks; pancake networks; dilation.

Full Article - PDF    Page 1-20

DOI : 10.9734/BJMCS/2012/872

Review History    Comments

Our Contacts

Guest House Road, Street no - 1/6,
Hooghly, West Bengal,

+91 8617752708


Third Floor, 207 Regent Street
London, W1B 3HH,

+44 20-3031-1429