Rainbow Connectivity of Directed Double Loop Networks
Liu Xin-xi · Journal of Xiamen University · 2014
Let 1≤s1s2n.A directed double loop network G(n;s1,s2)is a digraph(V(G),E(G)),which is defined as follows:its vertex set V(G)=Zn={0,1,2,…,n-1},and its edge set E(G)={i→i+s1(modn),i→i+s2(modn)|i=0,1,2,…,n-1}.A rainbow-connected edge color scheme for a directed double loop network,G(n;s1,s2)is proposed in this paper.Thus an upper bound of the rainbow connection number for G(n;s1,s2)is obtained and is mainly represented by two parameters of the L-shaped tile that is determined by G(n;s1,s2).