Characterization of node disjoint (parallel) path in star graphs

This paper presents an analysis that leads to the complete characterization of the node disjoint (parallel) paths in a star graph. It is shown that by exploiting the cycle structure of permutations (same as the conjugacy class) one can decentralize a routing algorithm for transfer of packets between a pair of nodes in these graphs.<
>