2-Hamming图的强Menger边连通容错性  

Edge Fault-Tolerance of Strongly Menger Edge Connected 2-Hamming Graphs

作　　者：解国强 孟吉翔[1] XIE Guoqiang;MENG Jixiang(School of Mathematics and System Sciences,Xinjiang University,Urumqi Xinjiang 830017,China)

机构地区：[1]新疆大学数学与系统科学学院,新疆乌鲁木齐830017

出　　处：《新疆大学学报（自然科学版）（中英文）》2023年第6期671-675,682,共6页Journal of Xinjiang University(Natural Science Edition in Chinese and English)

基　　金：新疆维吾尔自治区自然科学基金“图与网络的容错”(2020D04046);国家自然科学基金“图的不交路覆盖性及相关问题研究”(12261085)。

摘　　要：设G是连通图.若G的任一对顶点u,v之间有min{d(u),d(v)}条边不交的路,则称连通图G为强Menger边连通的.设G是强Menger边连通图,m是非负整数,若对任意满足|F|≤m的边子集F,G-F都是强Menger边连通图,则称G是m-边容错强Menger边连通图.证明了2-Hamming图H(n,k,2)是(4n-2)-边容错强Menger边连通的,其中n≥2,k≥5.A connected graph G is strongly Menger edge connected if any two of its vertices u,v are connected by min{d(u),d(v)}edge-disjoint paths.Let G be a strongly Menger edge connected graph and m be a non-negative integer,G is said to be m-edge tolerant strongly Menger edge connected if G−F is strongly Menger edge connected for any edge subset F with|F|≤m.It is proved in this paper that the 2-Hamming graphs H(n,k,2)are(4n−2)-edge fault-tolerant strongly Menger edge connected for n≥2,k≥5.

关 键 词：容错性 强Menger边连通性 h-Hamming图 边不交路 

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