在1-连通和2-连通的二部图中保持连通度的一些树的研究On the Connectivity Keeping some Trees in Connected and 2-Connected Bipartite Graphs
罗莲,田应智
摘要(Abstract)：
在2010年,Mader猜想对任意的阶为m的树T,每一个最小度至少为■的k-连通图G中存在一个子树■,使得G-V (T′)仍然是k-连通的.对于二部图,提出了类似的猜想:对任意的二部划分为X和Y的树T (记t=max{|X|,|Y|}),每一个最小度至少为k+t的k-连通的二部图G中存在一个子树■,使得G-V (T′)仍然是k-连通的.最后验证了该猜想在k=1和k=2时,T是一个有至多3个内点的毛毛虫图的情形是对的.
关键词(KeyWords)： 点连通度;毛毛虫图;星图;双星图;二部图
基金项目(Foundation): 国家自然科学基金（11861066）;; 新疆天山青年项目（2018Q066）
作者(Author): 罗莲,田应智
DOI: 10.13568/j.cnki.651094.651316.2021.03.24.0001
参考文献(References)：
- [1]BONDY J A,MURTY U S R.Graph theory[M].Berlin:Springer,2008.
- [2]CHARTRAND G,KAUGARS A,LICK D R.Critically n-connected graphs[J].Proc Amer Math Soc,1972,32:63-68.
- [3]FUJITA S,KAWARABAYASHI K.Connectivity keeping edges in graphs with large minimum degree[J].J Combinatorial Theory Ser B,2008,98:805-811.
- [4]MADER W.Connectivity keeping paths in k-connected graphs[J].J Graph Theory,2010,65:61-69.
- [5]MADER W.Connectivity keeping trees in k-connected graphs[J].Graph Theory,2012,69:324-329.
- [6]DIWAN A A,THOLIYA N P.Non-separating trees in connected graphs[J].Discrete Math,2009,309:5235-5237.
- [7]TIAN Y Z,MENG J X,LAI H J,et al.Connectivity keeping stars or double-stars in 2-connected graphs[J].Discrete Math,2018,341(4):1120-1124.
- [8]TIAN Y Z,LAI H J,XU L Q,et al.Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs[J].Discrete Math,2019,342(2):344-351.
- [9]HASUNUMA T,ONO K.Connectivity keeping trees in 2-connected graphs[J].Graph Theory,2020,94(1):20-29.
- [10]LU C H,ZHANG P.Connectivity keeping trees in 2-connected graphs[J].Discrete Math,2020,343(2):1-4.
- [11]HONG Y M,LIU Q H,LU C H,et al.Connectivity keeping caterpillars and spiders in 2-connected graphs[J].Discrete Math,2021,344(3):112236.
- [12]ZHANG S,TIAN Y Z,MENG J X.Arc connectivity of balanced half-transitive digraphs[J].Journal of Xinjiang University(Natural Science Edition),2014,31(1):22-25.
- [13]TIAN Y Z,MENG J X,CHEN X.On restricted edge-connectivity of half-transitive multigraphs[J].Journal of Xinjiang University(Natural Science Edition),2018,35(1):34-41.