典型文献
A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected
文献摘要：
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.
文献关键词：
中图分类号：
作者姓名：
Jian-hua YIN;Ji-yun GUO
作者机构：
School of Science,Hainan University,Haikou 570228,China
文献出处：
引用格式：
[1]Jian-hua YIN;Ji-yun GUO-.A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected)[J].应用数学学报（英文版）,2022(01):223-228
A类：
Forcibly,forcibly
B类：
New,Sufficient,Degree,Condition,Graphic,Sequence,Be,Edge,Connected,graphic,sequence,d1,d2,dn,said,be,edge,connected,if,every,realization,In,this,paper,we,obtain,new,sufficient,degree,condition,We,also,show,that,implies,strongest,monotone,conjecture,about,due,Bauer,Networks
AB值：
0.46645
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
