Representations and routing for Cayley graphs (computer networks)
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 39 (11) , 1533-1537
- https://doi.org/10.1109/26.111428
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Routing for generalized chordal ringsPublished by Association for Computing Machinery (ACM) ,1990
- A group-theoretic model for symmetric interconnection networksIEEE Transactions on Computers, 1989
- Interconnection Networks Based on a Generalization of Cube-Connected CyclesIEEE Transactions on Computers, 1985
- Tables of large graphs wh given degree and diameterInformation Processing Letters, 1982
- The diameter of random regular graphsCombinatorica, 1982
- Explicit constructions of graphs without short cycles and low density codesCombinatorica, 1982
- Analysis of Chordal Ring NetworkIEEE Transactions on Computers, 1981
- Algebraic Graph TheoryPublished by Cambridge University Press (CUP) ,1974