Abstract
In the recent paper[1], a family of degree 4 Cayley graphs G n : n ≥ 3 was proposed and investigated. This note shows that the proposed graph G n is just the well-known wrapped n-dimensional binary butterfly.
This work was partially supported by the National Natural Science Foundation of China.
References
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.
F.Annexstein,M.Baumslay,and A.Rosenberg, Group Action Graphs and Parallel Architectures. SIAM J.Comput, 19 (1990),pp.544–569.
M.C.Heydemann,J.G.Peters,and D.Sotteau, Spanners of Hypercube-derived Networks. SIAM J.Discrete Math.9 (1996),pp.37–54.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Y., Li, Q. (1997). They are just butterflies. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045118
Download citation
DOI: https://doi.org/10.1007/BFb0045118
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63357-0
Online ISBN: 978-3-540-69522-6
eBook Packages: Springer Book Archive