万海云,姜海宁

• 1:菏泽医学专科学校公共教学部
• 2:菏泽学院数学与统计学院

摘要(Abstract)：

如果删除一个图G的边集E后，至少有两个连通分支有圈，则称E为图G的圈边割，把有圈边割的图称为圈可分的.对于一个圈可分图G来说，最小圈边割的基数称为圈边连通度λ_c(G).如果去除任何一个最小圈边割，总存在一连通分支为最小圈，则图G为超圈边连通的.利用反证法，得到一个(k≥4)正则围长g(G)≥6的点传递二部图是超圈边连通的.

关键词(KeyWords)： 圈边连通度;圈边割;超圈边连通性;轨道

Abstract:

Keywords:

基金项目(Foundation): 国家自然科学基金(12061007)

作者(Author): 万海云,姜海宁

DOI: 10.16393/j.cnki.37-1436/z.2024.05.019

参考文献(References)：

• [1]Latifi S,Hegde M,Naraghi-Pour M.Conditionaal Connectivity Measures for Large Multiprocessor Systems[J].IEEE Trans Comput,2002,43(2):218-222.
• [2]Ji S-J,Ma H-P,Ma Gang.The Matching Energy of Graphs with Given Edge Connectivity[J].Journal of Inequalities and Applications,2015,30(3):60-69.
• [3]龚奇娟，余柱东，丁超.图的最小严格控制数[J].菏泽学院学报，2013,35(02):1-4.
• [4]C.Chekuri,T.Rukkanchanunt,Xu Chao.On Element-Connectivity Preserving Graph Simplification[J].Lect Notes Math,2015,24(2):313-324.
• [5]Ning W-T.The Super Connectivity of Exchanged Crossed Cube[J].Information Processing Letter,2016,116(3):80-84.
• [6]Lovasz L.On Graphsnot Containing independent Circuits[J].Mat Lapole,1965,16(1):289-299.
• [7]Bollobas B.Extremal Graph theory[M].London:Academic Press,1978:21-36
• [8]Plummer M D.On the Cyclic Connectivity of Planar Graphs[J].Lect Notes Math,1972,303(5):235-242.
• [9]Tait P G.Remarks on the Colouring of Maps[J].Proc R Soc Edinb,1998,10:501-503.
• [10]Robertson N.Minimal Cyclic-4-Connected Graphs[J].Trans Am Math Soc,1984,284(4):665-684.
• [11]Zhang C Q.Integer Flows and Cycle Covers of Graphs[M].New York:Academic Press,1997:16-34.
• [12]Holton D A,Lou D,Plummer M D.On the 2-Extendability of Planar Graphs[J].Discrete Math,1991,96(3):81-99.
• [13]Wang B,Zhang Z.On the Cyclic Edge -Connectivity of Transitive Graphs[J].Discrete Math,2009,309(2):4555-456.
• [14]Meng J X.Optimally Super-Edge-Connected Transitive Graphs[J].Discrete Math,2003,206(4):239-248.
• [15]Xu M J.On Conditional Edge-Connectivity of Graphs[J].Acta Math.Appl.Sinica B,2002,16(3):414-419.
• [16]Zhang Z,Wang B.Super Cyclically Edge-Connected Transitive Graphs[J].J Comb Optim,2011,22(2):549-562.
• [17]Lin H Q,Yang W-H,Meng J-X.On Cyclic Edge Connectivity of Graphs with Two Orbits of Same Size[J].Journal of Mathematical Study,2010,43(2):1-9.
• [18]Tian Y Z,Meng J X.λc-Optimally Half Vertex Transitive Graphs with Regularity K[J].Information Processing Letters,2009,109(5) :683-686.