Trivalent Cayley graphs for interconnection networks

DOI10.1016/0020-0190(95)00068-NzbMath0875.68688OpenAlexW1980132362MaRDI QIDQ672973

Pradip K. Srimani, Premkumar Vadapalli

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00068-n

zbMATH Keywords

Cayley graphFault toleranceInterconnection networkComputer architectureFixed degreeOptimal routing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

A new 3D representation of trivalent Cayley networks ⋮ A new family of trivalent Cayley networks on wreath product \(Z_{m}\wr S_{n}^\ast\) ⋮ Shortest routing in trivalent Cayley graph network ⋮ Hamilton cycles in Trivalent Cayley graphs ⋮ The Cayley network of expanded Pancake graphs ⋮ On the pagenumber of trivalent Cayley graphs ⋮ A note on thek-degree Cayley graph ⋮ OPTIMAL LAYOUT OF TRIVALENT CAYLEY INTERCONNECTION NETWORKS ⋮ The correct diameter of trivalent Cayley graphs.

Cites Work

• Decomposing a star graph into disjoint cycles
• Arrangement graphs: A class of generalized star graphs
• Parallel concepts in graph theory
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• A group-theoretic model for symmetric interconnection networks
• Dense Trivalent Graphs for Processor Interconnection
• A Fault-Tolerant Communication Architecture for Distributed Systems
• Representations and routing for Cayley graphs (computer networks)

This page was built for publication: Trivalent Cayley graphs for interconnection networks