New methods for using Cayley graphs in interconnection networks
From MaRDI portal
Publication:1199417
DOI10.1016/0166-218X(92)90127-VzbMath0768.68129MaRDI QIDQ1199417
Gene Cooperman, Larry Finkelstein
Publication date: 16 January 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items (15)
Minimal sense of direction in regular networks ⋮ Routing permutations on a graph ⋮ Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes ⋮ Characterization of \(c\)-circulant digraphs of degree two which are circulant ⋮ Absorption Cayley graph ⋮ The extendability of Cayley graphs generated by transpositions ⋮ Gossiping and routing in second-kind Frobenius graphs ⋮ A note on characterization of the induced matching extendable Cayley graphs generated by transpositions ⋮ Proof Pearl: Revisiting the Mini-rubik in Coq ⋮ Cayley fuzzy graphs on the fuzzy groups ⋮ A survey on the Intersection graphs of ideals of rings ⋮ About some robustness and complexity properties of \(G\)-graphs networks ⋮ Bipancyclic properties of Cayley graphs generated by transpositions ⋮ A New Property of Hamming Graphs and Mesh of d-ary Trees ⋮ Rotational circulant graphs
Cites Work
- Construction of defining relators for finite groups
- Systems of reductions
- A strong generating test and short presentations for permutation groups
- Computing in Permutation and Matrix Groups II: Backtrack Algorithm
- Group Action Graphs and Parallel Architectures
- Interconnection Networks Based on a Generalization of Cube-Connected Cycles
- A compact representation for permutation groups
- A New Base Change Algorithm for Permutation Groups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: New methods for using Cayley graphs in interconnection networks
