Processor interconnection networks from Cayley graphs

DOI10.1016/0166-218X(92)90005-UzbMath0782.68014MaRDI QIDQ1208451

Stephen T. Schibell, Richard M. Stafford

Publication date: 16 May 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Cayley graphspermutation groupparallel computersroutingMIMD machine

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Mathematical problems of computer architecture (68M07)

Related Items (8)

Minimal sense of direction in regular networks ⋮ On reconstruction of normal edge-transitive Cayley graphs ⋮ Cayley graphs of groupoids and generalized fat-trees ⋮ On two-sided Cayley graphs of semigroups and groups ⋮ Groups with a Cayley graph isomorphic to a hypercube ⋮ Cycles in the burnt pancake graph ⋮ Vertex reconstruction in Cayley graphs ⋮ Cayley graphs as classifiers for data mining: the influence of asymmetries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Small-diameter Cayley graphs for finite simple groups
• Permutations of bounded degree generate groups of polynomial diameter
• On the diameter of Cayley graphs of the symmetric group
• On Group Graphs and Their Fault Tolerance
• On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations

This page was built for publication: Processor interconnection networks from Cayley graphs