极大4限制边连通图的充分条件  

A Sufficient Condition for Maximally 4 Restricted Edge Connected Graphs

作　　者：郝海霞[1] 张磊[1] 徐子钧[1] HAO Hai-xia;ZHANG Lei;XU Zi-jun(School of Mathematics,Jinzhong University,Jinzhong Shanxi,030619)

机构地区：[1]晋中学院数学学院,山西晋中030619

出　　处：《山西大同大学学报（自然科学版）》2020年第1期33-35,49,共4页Journal of Shanxi Datong University(Natural Science Edition)

基　　金：国家自然科学基金资助项目[61370001];晋中学院博士基金资助项目[bsjj2016202]。

摘　　要：设G=(V,E)是一个连通图。称一个边集合S⊆E是一个k限制边割,如果G-S的每个连通分支至少有k个顶点。称G的所有k限制边割中所含边数最少的边割的基数为G的k限制边连通度,记为λk(G)。给出了图是极大4限制边连通的充分条件。For a connected network[G=(V,E)],an edge set[S⊆E]is a restricted edge cut if[G-S]is disconnected and every com⁃ponent of[G-S]has at least k vertices.The k-restricted edge connectivity of[G],denoted by[λkG],is defined as the cardinality of a minimum k-restricted edge cut.In this paper,a sufficient condition is presented for maximally 4 restricted edge connected graphs.

关 键 词：互连网络 极大4限制边连通图 4限制边连通度 围长 

分 类 号：O177.91[理学—数学]