CAJ | 학술논문

笛卡尔乘积是从若干特定的小网络构造大网络的有效方法,边容错直径是衡量一个网络可靠性和效用性的重要标准,研究了笛卡尔乘积网络的边容错直径,并且得到了一个相关的结果.对任何t1,t2≥1,若G1,G2分别是t1边连通的和t2边连通的,则它们的笛卡尔乘积图的边容错直径D＇t1＋t2（G1×G2）≤D＇t1（G1）＋D＇t2（G2）＋1.并且,该不等式中的上界是最好的.
적잡이승적시종약간특정적소망락구조대망락적유효방법,변용착직경시형량일개망락가고성화효용성적중요표준,연구료적잡이승적망락적변용착직경,병차득도료일개상관적결과.대임하t1,t2≥1,약G1,G2분별시t1변련통적화t2변련통적,칙타문적적잡이승적도적변용착직경D＇t1＋t2（G1×G2）≤D＇t1（G1）＋D＇t2（G2）＋1.병차,해불등식중적상계시최호적.
The method of Cartesian product is widely used as constructing large interconnection networks from many specific small networks. In this paper, we study the edge fault-tolerant diameter of Cartesian product graphs, which is an important measurement for reliability and efficiency of interconnection networks. Let G1 , G2 be t1-edge- connected graph and tE-edge-cOnnected graph respectively, then the edge fault-tolerant diameter of G1 × G2 has an optimal upper bound that D＇t1＋t2（G1 ×G2） ≤D＇t1（G1）＋D＇t2（G2）＋1 ,where tI ,t2≥1.