A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected  

作　　者：Jian-hua YIN Ji-yun GUO 

机构地区：[1]School of Science,Hainan University,Haikou 570228,China

出　　处：《Acta Mathematicae Applicatae Sinica》2022年第1期223-228,共6页应用数学学报（英文版）

基　　金：supported by the Hainan Provincial Natural Science Foundation of China(No.2019RC085);the National Natural Science Foundation of China(No.11961019)。

摘　　要：A graphic sequence π =(d1, d2,..., dn) is said to be forcibly k-edge-connected if every realization of π is k-edge-connected. In this paper, we obtain a new sufficient degree condition for π to be forcibly k-edgeconnected. We also show that this new sufficient degree condition implies a strongest monotone degree condition for π to be forcibly 2-edge-connected and a conjecture about a strongest monotone degree condition for π to be forcibly 3-edge-connected due to Bauer et al.(Networks, 54(2)(2009) 95-98), and also implies a strongest monotone degree condition for π to be forcibly 4-edge-connected.

关 键 词：graphic sequence forcibly k-edge-connected graphic sequence a strongest monotone degree condition 

分 类 号：O157.5[理学—数学]