Forwarding indices of folded n n -cubes ?
For a given connected graph G of order n, a routing R  is a set of n(n-1) n ( n - 1 ) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forwarding index of a graph is the maximum number of paths of R passing through any vertex (resp. edge) in the graph. In this paper, the authors determine the vertex and the edge forwarding indices of a folded n -cube as ( n - 1 ) 2 n - 1 + 1 - ( ( n + 1 ) / 2 ) n n + 1 2 and 2 n - n n + 1 2 , respectively.
vertex forwarding index edge forwarding index folded n-cubes