Advertisement

They are just butterflies

  • Yonghong Chen
  • Qiao Li
Session 15: Parallel and Distributed Computing III
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1276)

Abstract

In the recent paper[1], a family of degree 4 Cayley graphs Gn : n ≥ 3 was proposed and investigated. This note shows that the proposed graph Gn is just the well-known wrapped n-dimensional binary butterfly.

References

  1. 1.
    P.Vandapalli and P.K.Srimani, A new Family of Cayley Graph Interconnection Networks of Constant Degree Four. IEEE Trans. Parallel and Distributed Systems, vol.7,no.1,pp.26–32,Jan.1996.Google Scholar
  2. 2.
    F.Annexstein,M.Baumslay,and A.Rosenberg, Group Action Graphs and Parallel Architectures. SIAM J.Comput, 19 (1990),pp.544–569.Google Scholar
  3. 3.
    M.C.Heydemann,J.G.Peters,and D.Sotteau, Spanners of Hypercube-derived Networks. SIAM J.Discrete Math.9 (1996),pp.37–54.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Yonghong Chen
    • 1
  • Qiao Li
    • 1
  1. 1.Dept. Appl.Math.Shanghai Jiao Tong Univ.China

Personalised recommendations