Strong Rainbow Edge Coloring of Some Interconnection Networks

A rainbow edge coloring of a connected graph is a coloring of the edges of the graph, such that every pair of vertices is connected by at least one path in which no two edges are colored the same. Rainbow coloring has received much attention recently in the field of interconnection networks. Computing the rainbow connection number of a graph is NP- hard and it finds its applications in the secure transfer of classified information between agencies and in cellular network. This paper investigates the strong rainbow connection numbers of butterfly network, Benes network and torus network.