We present a technique for building, in some Cayley graphs, a routing for which the load of every edge is almost the same. This technique enables us to find the edge-forwarding index of star graphs and complete-transposition graphs.
Gauyacq, G. (1997). Edge-forwarding index of star graphs and other Cayley graphs. Discrete Applied Mathematics, 80(2–3), 149–160. https://doi.org/10.1016/S0166-218X(97)00052-8