The Cayley network of expanded Pancake graphs

Abstract

Signed permutation group has important applications in genome rearrangement as well as the construction of networks. In this paper, we propose a new interconnection network named extended Pancake graph, we investigate its topological properties, and give a routing algorithm with the diameter upper bounded by 2n−1. Some embedding properties are also derived. In conclusion, we present a comparison of some familiar networks with the Cayley graph EP _n .

Keywords:

• Signed permutation
• Network
• Cayley graph
• Routing
• Diameter

Additional information

Notes on contributors

Shuming Zhou

Email: [email protected]