Forwarding index of cube-connected cycles Original Research Article

For a given connected graph image of order image, a routing image in image is a set of image elementary paths specified for every ordered pair of vertices in image. The vertex (resp. edge) forwarding index of image is the maximum number of paths in image passing through any vertex (resp. edge) in image. Shahrokhi and Székely [F. Shahrokhi, L.A. Székely, Constructing integral flows in symmetric networks with application to edge forwarding index problem, Discrete Applied Mathematics 108 (2001) 175–191] obtained an asymptotic formula for the edge forwarding index of image-dimensional cube-connected cycle image as image. This paper determines the vertex forwarding index of image as image asymptotically.