Rainbow connectivity in some Cayley graphs

The rainbow and strong rainbow connection numbers, as well as variants of these in which the edge colorings are required to be proper, are estimated and in some cases determined exactly for some Cayley graphs, including the Hamming graphs H(n, q, k), excluding the cases (i) k = n and (ii) k < n, k even and q = 2.