Publication 1999 Issue No. 12 - December Abstract - Isomorphism of Degree Four Cayley Graph and Wrapped Butterfly and Their Optimal Permutation Routing Algorithm
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by David S.L. Wei Articles by Felix P. Muga Articles by Kshirasagar Naik
Isomorphism of Degree Four Cayley Graph and Wrapped Butterfly and Their Optimal Permutation Routing Algorithm
December 1999 (vol. 10 no. 12)
pp. 1290-1298
 ASCII Text x David S.L. Wei, Felix P. Muga, Kshirasagar Naik, "Isomorphism of Degree Four Cayley Graph and Wrapped Butterfly and Their Optimal Permutation Routing Algorithm," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 12, pp. 1290-1298, December, 1999.
 BibTex x @article{ 10.1109/71.819950,author = {David S.L. Wei and Felix P. Muga and Kshirasagar Naik},title = {Isomorphism of Degree Four Cayley Graph and Wrapped Butterfly and Their Optimal Permutation Routing Algorithm},journal ={IEEE Transactions on Parallel and Distributed Systems},volume = {10},number = {12},issn = {1045-9219},year = {1999},pages = {1290-1298},doi = {http://doi.ieeecomputersociety.org/10.1109/71.819950},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Parallel and Distributed SystemsTI - Isomorphism of Degree Four Cayley Graph and Wrapped Butterfly and Their Optimal Permutation Routing AlgorithmIS - 12SN - 1045-9219SP1290EP1298EPD - 1290-1298A1 - David S.L. Wei, A1 - Felix P. Muga, A1 - Kshirasagar Naik, PY - 1999KW - Cayley graphKW - wrapped butterflyKW - isomorphismKW - permutation routing.VL - 10JA - IEEE Transactions on Parallel and Distributed SystemsER -

Abstract—In this paper, we first show that the degree four Cayley graph proposed in a paper appearing in the January 1996 issue of IEEE Transactions on Parallel and Distributed Systems is indeed isomorphic to the wrapped butterfly. The isomorphism was first reported by Muga and Wei in the proceedings of PDPTA "96.The isomorphism is shown by using an edge-preserving bijective mapping. Due to the isomorphism, algorithms for the degree four Cayley graph can be easily developed in terms of wrapped butterfly and topological properties of one network can be easily derived in terms of the other. Next, we present the first optimal oblivious one-to-one permutation routing scheme for these networks in terms of the wrapped butterfly. Our algorithm runs in time $O(\sqrt{N})$, where $N$ is the network size.

Index Terms:
Cayley graph, wrapped butterfly, isomorphism, permutation routing.
Citation:
David S.L. Wei, Felix P. Muga, Kshirasagar Naik, "Isomorphism of Degree Four Cayley Graph and Wrapped Butterfly and Their Optimal Permutation Routing Algorithm," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 12, pp. 1290-1298, Dec. 1999, doi:10.1109/71.819950