摘要
设G=(V,E)是一个λk-连通图,称图G的λk-割所含边的数目为G的k限制边连通度.定义ξk(G)=min{|[X,Y]|∶|X|=k,G[X]连通,Y=V(G)\X}.拟研究λ5(G)=ξ5(G)的围长条件.
For aλk-connected G=(V,E),the k-restricted edge connectivity of G,denoted byλk(G),was defined as the cardinality of a minimumλk-cut.Letξk(G)=min{|[X,Y]|∶|X|=k,G[X]is connected,where Y=V(G)\X}.In this paper,a girth condition was presented for graphs to be maximally 5-restricted edge connected.
作者
张磊
郝海霞
王美玉
ZHANG Lei;HAO Hai-xia;WANG Mei-yu(School of Mathematics,Jinzhong University,Jinzhong 030619,Shanxi,China)
出处
《兰州文理学院学报(自然科学版)》
2019年第5期1-3,17,共4页
Journal of Lanzhou University of Arts and Science(Natural Sciences)
基金
国家自然科学基金资助项目(61370001)
晋中学院博士基金资助项目(bsjj2016202)
关键词
互连网络
极大5限制边连通图
围长
interconnected graphs
maximally 5-restricted edge connected graphs
girth