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

@article{Vadapalli1996ANF,
  title={A New Family of Cayley Graph Interconnection Networks of Constant Degree Four},
  author={Premkumar Vadapalli and Pradip K. Srimani},
  journal={IEEE Trans. Parallel Distrib. Syst.},
  year={1996},
  volume={7},
  pages={26-32}
}
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. 

From This Paper

Figures, tables, and topics from this paper.
26 Citations
27 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Burke . dBCube : a new class of hierarchical multiprocessor interconnection networks with area efficient layout

  • G. E. Carlsson, J. E. Cruthirds, H. B. Sexton, C. G. Wright
  • IEEE Transactions on Parallel and Distributed…
  • 1993

39:1533–1537

  • B. W. Arden, K. W. Tang. Representation, routing of Cayley graphs. IEEE Transactions on Communications
  • December
  • 1991

Representation and routing of Cayley graphs

  • D. P. Agrawal
  • IEEE Transactions on Communications
  • 1991

Similar Papers

Loading similar papers…