Some characterizations for the wrapped butterfly

Authors:
Yaokun Wu;Qiao Li
Affiliations:
Department of Applied Mathematics, Shanghai Jiao Tong University, Shanghai 200030, P. R. China;Department of Applied Mathematics, Shanghai Jiao Tong University, Shanghai 200030, P. R. China
Venue:
Analysis, combinatorics and computing
Year:
2002

Citing 16
Cited 1

A graph theoretical approach to equivalence of multistage interconnection networks

Discrete Applied Mathematics
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
n-Dimensional line digraphs

Discrete Mathematics
An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
A New Family of Cayley Graph Interconnection Networks of Constant Degree Four

IEEE Transactions on Parallel and Distributed Systems
Line digraphs and coreflexive vertex sets

Discrete Mathematics
Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees

IEEE Transactions on Parallel and Distributed Systems
Large generalized cycles

Discrete Applied Mathematics
Isomorphism of Degree Four Cayley Graph and Wrapped Butterfly and Their Optimal Permutation Routing Algorithm

IEEE Transactions on Parallel and Distributed Systems
A note on cyclic-cubes

Information Processing Letters
On the Isomorphism between Cyclic-Cubes and Wrapped Butterfly Networks

IEEE Transactions on Parallel and Distributed Systems
Cyclic-cubes and wrap-around butterflies

Information Processing Letters
The underlying line digraph structure of some (0,1)-matrix equations

Discrete Applied Mathematics
The Mathematical Theory of Nonblocking Switching Networks

The Mathematical Theory of Nonblocking Switching Networks
Comments on "A New Family of Cayley Graph Interconnection Networks of Constant Degree Four"

IEEE Transactions on Parallel and Distributed Systems
They are Just Butterflies

COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics

De Bruijn digraphs and affine transformations

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present some characterizations for the wrapped butterfly, a class of useful network models in parallel processing. Our characterizations are parallel to the characterization of Bermond et al. for the (ordinary) butterfly. But our approach seems more natural and provides some more insight. In the course of our study, we also give a slight improvement of a result of Beineke et al. which characterizes the iterated line digraph structure in terms of the Heuchenne's condition. Some related problems and conjectures are proposed at the end of the paper.