This paper presents an analysis that leads to the completecharacterization of the node disjoint (parallel) paths in a star graph.It is shown that by exploiting the cycle structure of permutations (sameas the conjugacy class) one can decentralize a routing algorithm fortransfer of packets between a pair of nodes in these graphs
展开▼