有向双环网络的彩虹路连通性  

Rainbow Connectivity of Directed Double Loop Networks

作　　者：刘欣欣[1] 陈宝兴[1] 钟玮[1] 

机构地区：[1]闽南师范大学计算机学院,福建漳州363000

出　　处：《厦门大学学报（自然科学版）》2014年第6期788-791,共4页Journal of Xiamen University：Natural Science

基　　金：福建省自然科学基金(2010J01354;2013J01028)

摘　　要：设1≤s1<s2<n.有向双环网络G(n;s1,s2)是如下定义的有向图(V(G),E(G)):其结点集是V(G)=Zn={0,1,2,…,n-1},边集是E(G)={i→i+s1(modn),i→i+s2(modn)|i=0,1,2,…,n-1}.给出了有向双环网络G(n;s1,s2)的彩虹路连通的一个边着色方案,并给出了其彩虹路连通数上界,它主要由G(n;s1,s2)所确定的L-形瓦的2个参数表示.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）.

关 键 词：有向双环网络 L-形瓦 彩虹路 彩虹路连通数 

分 类 号：O157.5[理学—数学]