代玉林,孟吉翔

• 1:新疆大学数学与系统科学学院

摘要(Abstract)：

图G是一个连通图.称X为三限制性割,如果G-X的每个连通分支至少有三个点.三限制性连通度κ3(G)是三限制性割的最小基数,更进一步,如果图G的围长为4,去掉最小的三限制性割孤立出一条二长路,则称它是超三限制性连通的.本文给定了图是超三限制性连通的直径围长充分条件,还研究了超三限制性边连通图.

关键词(KeyWords)： λ3-最优;直径;围长;超三限制性连通的;超三限制性边连通的

Abstract:

Keywords:

基金项目(Foundation): supported by NSFC (No.10671165)

作者(Author): 代玉林,孟吉翔

参考文献(References)：

• [1]Bondy J A,Murty U S R.Graph Theory with Applications[M].London:Macmilla Press,1976.
• [2]Harary F.Conditional connectivity[J].Network,1983,13:367-357.
• [3]GUO Li-tao,MENG Ji-xiang.3-restricted connectivity of graphs with given girth[J].Appl Math,2008,25(1):117-123.
• [4]Meng J X,Ji Y H.On a kind of restricted edge connectivity of graphs[J].Discrete Appl Math,2002,117:183-193.
• [5]Balbuena Camino,Lin Yu-qing,Miller Mirka.Diameter-suffuicient conditions for a graph to be super-restricted connected[J].Discrete ApplMath,2008,156:2827-2834.
• [6]Fabrega J,Fiol M A.Extraconnectivity of graphs with large girth[J].Discrete Math,1994,127:163-170.
• [7]Bonsma P,Ueffing N,Volkman L.Edge-cuts leaving components of order at least three[J].Discrete Math,2002,256:431-439.
• [8]Esfahanian A H,Hakimi S L.On computing a conditional edge connectivity of a graph[J].Inform Process Lett,1988,27:195-199.
• [9]Balbuena C,Cera M,Dia′nez A,et al.Diameter-girth sufficient conditions for optimal extraconnectivity in graphs[J].Discrete math,2008,308:3526-3536.
• [10]Balbuena C,Garcia-Va′zquez P,Marcote X.Suffiencient conditions forλ-optimality in graphs with girth g[J].J Graph Theory,2006,52:73-86.