Trivalent Cayley graphs for interconnection networks

Information Processing Letters

Volumn 54, Issue 6, 1995, Pages 329-335

  Vadapalli, Premkumar ^a   Srimani, Pradip K ^a  

^a Department of Environmental and Radiological Health Sciences   (United States)

Author keywords

Cayley graph; Computer architecture; Fault tolerance; Fixed degree; Interconnection network; Optimal routing

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTER ARCHITECTURE; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; MULTIPROCESSING SYSTEMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; TOPOLOGY;

FIXED DEGREE; LOGARITHMIC DIAMETER; OPTIMAL ROUTING; TRIVALENT CAYLEY GRAPHS;

INTERCONNECTION NETWORKS;

EID: 0029327218     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(95)00068-N     Document Type: Article

References (17)

1. A group-theoretic model for symmetric interconnection networks
2. The star graph: An attractive alternative to n-cube
3. Decomposing a star graph into disjoint cycles
4. Generalized hypercube and hyperbus structure for a computer network
5. On some properties and algorithms for the star and pancake interconnection networks
6. Representation and routing of Cayley graphs
7. Orthogonal graphs for the construction of interconnection networks
8. Arrangement graphs: A class of generalized star graphs
9. Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
10. dBCube: A new class of hierarchical multiprocessor interconnection networks with area efficient layout
11. The De Bruijn multiprocessor network A versatile parallel processing and sorting network for VLSI
12. A fault tolerant communication architecture for distributed systems
13. Dense trivalent graphs for processor interconnection
14. Group graphs as interconnection networks
15. Cube connected Möbius ladders: An inherently deadlock free fixed degree network
16. Topological properties of hypercubes