| A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected |
| |
| 作者姓名： | Jian-hua YIN Ji-yun GUO |
| |
| 作者单位： | School of Science |
| |
| 基金项目： | 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...
|
| 关 键 词： | graphic sequence forcibly k-edge-connected graphic sequence a strongest monotone degree condition |
A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected |
| |
| Jian-hua YIN,Ji-yun GUO.A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected[J].Acta Mathematicae Applicatae Sinica,2022,38(1):223-228. |
| |
| Authors: | Yin Jian-hua Guo Ji-yun |
| |
| Institution: | 1.School of Science, Hainan University, Haikou, 570228, China
; |
| |
| Abstract: | Acta Mathematicae Applicatae Sinica, English Series - A graphic sequence π = (d1, d2, …, dn) is said to be forcibly k-edge-connected if every realization of π is k-edge-connected.... |
| |
| Keywords: | |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
