【摘要】 对不含完全子图K_r+1的图进行了研究,当图G满足λ<δ时,运用Turán定理,通过分析图的边连通度与图的度序列之间的关系,得出了图的边连通度的一些结果。更多还原

【Abstract】 In this paper, the graph without complete subgraph Kr+1 is studied when G satisfies λ<δ, using Turán theorem, by analyzing the relationship between the edge connectivity of a graph and the degree sequence of a graph, some results of the edge connectivity of a graph are obtained.更多还原