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

• 作者: Jian-hua YIN Ji-yun GUO
• 来源期刊: 应用数学学报（英文版）
• 年，卷（期）: 2022,（1）
• 页码范围: 223-228
• 页数: 6页
• 语种: 英文

摘要

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-edge-connected.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.