一类特殊图k-限制边连通度  

k-Restricted Edge Connectivity of a Class of Special Graphs

作　　者：石琳 武彩萍 杨卫华 Shi Lin;Wu Caiping;Yang Weihua(College of Mathematics,Taiyuan University of Technology,Taiyuan 030024,China)

机构地区：[1]太原理工大学数学学院,山西太原030024

出　　处：《南开大学学报（自然科学版）》2024年第1期86-90,共5页Acta Scientiarum Naturalium Universitatis Nankaiensis

基　　金：山西省自然科学基金(20210302123097)。

摘　　要：设F■E (G)为图G=(V,E)的一个边集,如果G-F不连通且G-F的每一个连通分支都至少有k个顶点,F就称为图G的一个k-限制性边割.图G的k-限制边连通度是图G的最小k-限制性边割的基数,记为λk(G).限制性边连通度是衡量网络可靠性的重要参数之一.证明了在2≤k≤n,h≤n/2的情况下,一类特殊图—蜻蜓网络D(n,h)的k-限制边连通度是■。Let F ■ E(G) be an edge set of the graph G =(V,E).If G-F is disconnected and every connected branch of G-F has at least k vertices,F is called a k-restricted edge cut of the graph G.The k-restricted edge connectivity of graph G,denoted as λk(G),is the cardinal number of the minimum k-restricted edge cut of graph G.The restricted edge connectivity is one of the important parameters to measure reliability of networks.The k-restricted edge connectivity of the dragonfly network D(n,h) is proved to be ■。

关 键 词：蜻蜓网 k-限制边连通度 网络 

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