Recursive cubes of rings as models for interconnection networks

DOI10.1016/j.dam.2016.09.026zbMath1358.05265arXiv1602.07374MaRDI QIDQ516899

Sanming Zhou, Hamid Mokhtar

Publication date: 15 March 2017

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

Full work available at URL: https://arxiv.org/abs/1602.07374

zbMATH Keywords

shortest path; Cayley graph; diameter; interconnection networks; routing; Wiener index; cube-connected cycles; bisection width; edge-forwarding index; recursive cube of rings; vertex-forwarding index

Mathematics Subject Classification ID

05C82: Small world graphs, complex networks (graph-theoretic aspects)

68M10: Network design and communication in computer systems

05C38: Paths and cycles

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

05C12: Distance in graphs