Rainbow connection in some digraphs

Research paper by Jesús Alva-Samos, Juan José Montellano-Ballesteros

Indexed on: 07 Apr '15Published on: 07 Apr '15Published in: Mathematics - Combinatorics


An edge-coloured graph $G$ is {\it rainbow connected} if any two vertices are connected by a path whose edges have distinct colours. This concept was introduced by Chartrand et al. in \cite{ch01}, and it was extended to oriented graphs by Dorbec et al. in \cite{DI}. In this paper we present some results regarding this extention, mostly for the case of circulant digraphs.