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

Authors

  • H. Mokhtar School of Mathematics and Statistics, The University of Melbourne,Parkville, VIC 3010, Australia

Keywords:

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

Abstract

DOI: 10.1017/S0004972717000028

Published

2017-04-29

Issue

Section

Abstracts of PhD Theses