传递图中的限制性边连通度(英文)Restricted Edge Connectivity in Transitive Graphs
张昭,黄晓晖
摘要(Abstract)：
设 G =( V,E)是一个连通图 ,S E是一个边子集 .如果 G -S不再连通 ,且 G -S的每一个连通分支都至少含有 r个点 ,则称 S为一个 r-限制性边割 .最小 r-限制性边割中所含的边数为 G的 r-限制性边连通度 ,记作λr( G) .如果对所有的 i=1 ,… ,r,λi( G)都达到其最大可能值 ,则称 G为λr- 最优图 .王铭和李乔证明了 :若 G是一个 d-正则的点传递图 ,d≥ 4,围长 g≥ 5 ,或者 G是一个 d-正则的边传递图 ,d≥ 4,围长 g≥ 4,则 G是λ(g - 1 ) -最优图 .本文推广了这一结果 ,证明了 :在同样的条件下 ,G是λg- 最优图
关键词(KeyWords)： 限制性边连通度;传递图;正则图
基金项目(Foundation): The research is supported by National Science Foundation of China.
作者(Author): 张昭,黄晓晖
参考文献(References)：
- [1]BauerD,BoeschF,SuffelC,VanSlykeR.On the validity of a reduction of reliable network design to a graph ex-tremal probel[J].IEEE Tran.Circuits andSystems,1989,34:1579-1581.
- [2]BondyJA,MurtyU S R.Graph theory and its application[M].AcademicPress,NorthHollandLondon:TheMacmil-lonPressLtd,1976.
- [3]BonsmaP,UeffingN,VolkmannL .Edge-cuts leaving components of order atleast three[J].DiscrMath2002,256:431-439.
- [4]EsfahanianA,HakimiS.On computing a conditional edgeconnectivity of a graph[J].Inform.Process.Lett1988,27:195-199.
- [5]FàbregaJ,FoilM A.On the extraconnectivity of graphs[J].DiscrMath,1996,155:49-57.
- [6]HararyF.Conditional connectivity[J].Networks,1983,13:347-357.
- [7]MengJX,JiY H.On a kind of restricted edge connectivity of graphs[J].DiscrMath,2002,117:183-193.
- [8]TindellR.Connectivity of cayley graphs[A].In:Combinatori alNetworkTheory(D.Z.Du andD.F.Hsueds.)1996,41-64.
- [9]WangM,LiQ.Conditional edge connectivity properties,reliability comparison and transitivity of graphs[J].DiscrMath,2002,258:205-214.