A New Family of Cayley Graph Interconnection Networks of Constant Degree Four

Authors:
Premkumar Vadapalli;Pradip K. Srimani
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1996

Citing 11
Cited 13

Interconnection Networks Based on a Generalization of Cube-Connected Cycles

IEEE Transactions on Computers
Topological Properties of Hypercubes

IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI

IEEE Transactions on Computers
Decomposing a star graph into disjoint cycles

Information Processing Letters
Arrangement graphs: a class of generalized star graphs

Information Processing Letters
dBCube: A New Class of Hierarchical Multiprocessor Interconnection Networks with Area Efficient Layout

IEEE Transactions on Parallel and Distributed Systems
On some properties and algorithms for the star and pancake interconnection networks

Journal of Parallel and Distributed Computing
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Graph Algorithms

Graph Algorithms
Orthogonal Graphs for the Construction of a Class of Interconnection Networks

IEEE Transactions on Parallel and Distributed Systems

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

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
Construction of Hamiltonian Circuits in Cayley Graphs Modeling Multiprocessing Computer Systems

Automation and Remote Control
Comments on "A New Family of Cayley Graph Interconnection Networks of Constant Degree Four"

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

Parallel Computing
Hyper-Butterfly Network: A Scalable Optimally Fault Tolerant Architecture

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Some characterizations for the wrapped butterfly

Analysis, combinatorics and computing
A new family of interconnection networks of fixed degree three

Journal of Computer Science and Technology
A new family of interconnection networks of odd fixed degrees

Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
An extended star graph: a proposal of a new network topology and its fundamental properties

International Journal of Computational Science and Engineering
An extended star graph: a proposal of a new network topology and its fundamental properties

ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Fault tolerant and fixed scalable structure of middle-agents

CLIMA IV'04 Proceedings of the 4th international conference on Computational Logic in Multi-Agent Systems
Mutually independent hamiltonian cycles of binary wrapped butterfly graphs

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new family of interconnection networks that are Cayley graphs with constant node degree 4. These graphs are regular, have logarithmic diameter, and are maximally fault tolerant. We investigate different algebraic properties of these networks (including fault tolerance) and propose optimal routing algorithms. As far as we know, this is the first family of Cayley graphs of constant degree 4.