Shortest routing in trivalent Cayley graph network

DOI10.1016/0020-0190(96)00004-XzbMath0900.68330OpenAlexW2038989312MaRDI QIDQ672093

Premkumar Vadapalli, Pradip K. Srimani

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00004-x

zbMATH Keywords

Cayley graphInterconnection networksDiameterFixed degreeShortest routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

A new 3D representation of trivalent Cayley networks ⋮ On the pagenumber of trivalent Cayley graphs ⋮ OPTIMAL LAYOUT OF TRIVALENT CAYLEY INTERCONNECTION NETWORKS ⋮ The correct diameter of trivalent Cayley graphs.

Cites Work

• Trivalent Cayley graphs for interconnection networks
• 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

This page was built for publication: Shortest routing in trivalent Cayley graph network