Forwarding index of cube-connected cycles

For a given connected graph GG of order vv, a routing RR in GG is a set of v(v−1)v(v−1) elementary paths specified for every ordered pair of vertices in GG. The vertex (resp. edge) forwarding index of GG is the maximum number of paths in RR passing through any vertex (resp. edge) in GG. 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 nn-dimensional cube-connected cycle CCCnCCCn as 54n22n(1−o(1)). This paper determines the vertex forwarding index of CCCnCCCn as 74n22n(1−o(1)) asymptotically.