A few families of Cayley graphs and their efficiency as communication networks

H. Mokhtar


Cayley graph, circulant graphs, cube-connected cycles, interconnection networks, routing, shortest path, diameter, Wiener index, edge-forwarding index, vertex-forwarding index, bisection width

Remember, for most actions you have to record/upload into OJS
and then inform the editor/author via clicking on an email icon or Completion button.
Bulletin of the Aust. Math. Soc., copyright Australian Mathematical Publishing Association Inc.