摘要
对不含完全子图Kr+1的图进行了研究,当图G满足λ<δ时,运用Turán定理,通过分析图的边连通度与图的度序列之间的关系,得出了图的边连通度的一些结果。
In this paper,the graph without complete subgraph Kr+1 is studied when G satisfiesλ<δ,using Turán theorem,by ana-lyzing the relationship between the edge connectivity of a graph and the degree sequence of a graph,some results of the edge connec-tivity of a graph are obtained.
作者
王晓丽
张国志
WANG Xiao-li;ZHANG Guo-zhi(Department of Mathematics,Jinzhong University,Yuci Shanxi,030619)
出处
《山西大同大学学报（自然科学版）》
2021年第3期22-23,共2页
Journal of Shanxi Datong University(Natural Science Edition)
基金
晋中学院博士基金科研项目[BSJJ2016202]
晋中学院教学改革与研究项目[JG201920]。
关键词
边连通度
度序列
边割
edge connectivity
degree sequence
edge cut
