The Forwarding Indices of Graphs -- a Survey <s> 12. <s> Abstract We study the integral uniform (multicommodity) flow problem in a graph G and construct a fractional solution whose properties are invariant under the action of a group of automorphisms Γ <s> BIB001 </s> The Forwarding Indices of Graphs -- a Survey <s> 12. <s> For a given connected graph G of order v, a routing R in G is a set of v(v-1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forwarding index of G is the maximum number of paths in R passing through any vertex (resp. edge) in G. Shahrokhi and Szekely [F. Shahrokhi, L.A. Szekely, 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 n-dimensional cube-connected cycle CCC"n as 54n^22^n(1-o(1)). This paper determines the vertex forwarding index of CCC"n as 74n^22^n(1-o(1)) asymptotically. <s> BIB002
For the cube-connected cycle CCC(n) and the k-dimensional wrapped butterfly W BF k (n), Yan, Xu, and Yang BIB002 , Shahrokhi and Székely BIB001 , determined ξ(CCC n ) = 7 4 n 2 2 n (1 − o(1)), π(CCC(n)) = π m (CCC(n)) = 5 4 n 2 2 n (1 − o(1)), π(W BF (n)) = π m (W BF 2 (n)) = 5 4 n 2 2 n−1 (1 + o(1) ). Hou, Xu and Xu  determined ξ(W B k (n)) = 3n(n − 1) 2 k n − n(k n − 1) k − 1 + 1.