Dense group networks

DOI10.1016/0166-218X(92)90125-TMaRDI QIDQ1199415zbMATH OpenFDO

Authors Lowell Campbell

Publication date 16 January 1993

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

Full work available at URL https://doi.org/10.1016/0166-218X(92)90125-T

zbMATH Keywords

Cayley graphgroupinterconnection networkparallel processing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• New results for the degree/diameter problem
• scientific article; zbMATH DE number 5309966
• Improved lower bounds on the degree-diameter problem
• Large Cayley graphs on an abelian group
• Large Cayley graphs of small diameter

Cites work

• On Group Graphs and Their Fault Tolerance

Cited in

(4)

• Connections between two cycles --- a new design of dense processor interconnection networks
• Table of large \(({\Delta{}}, D)\)-graphs
• New results for the degree/diameter problem
• Some new large (Δ, 3)‐graphs

This page was built for publication: Dense group networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199415)