Comments on "A New Family of Cayley Graph Interconnection Networks of Constant Degree Four"

Authors:
Guihai Chen;Francis C. M. Lau
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1997

Citing 2
Cited 6

Group action graphs and parallel architectures

SIAM Journal on Computing
A New Family of Cayley Graph Interconnection Networks of Constant Degree Four

IEEE Transactions on Parallel and Distributed Systems

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

IEEE Transactions on Parallel and Distributed Systems
Tighter Layouts of the Cube-Connected Cycles

IEEE Transactions on Parallel and Distributed Systems
Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance

Parallel Computing
Some characterizations for the wrapped butterfly

Analysis, combinatorics and computing
Note: The Independence Number for De Bruijn networks and Kautz networks

Discrete Applied Mathematics
Mutually independent hamiltonian cycles of binary wrapped butterfly graphs

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Vadapalli and Srimani [2] have proposed a new family of Cayley graph interconnection networks of constant degree four. Our comments show that their proposed graph is not new but is the same as the wrap-around butterfly graph. The structural kinship of the proposed graph with the de Bruijn graph is also discussed.