摘要
Let G be a 2-connected weighted graph and k≥2 an integer. In this note we prove that if the sum of the weighted degrees of every k+1 pairwise nonadjacent vertices is at least m, then G contains either a cycle of weight at least 2m/(k+1) or a spanning tree with no more than k leaves.
源语言 | 英语 |
---|---|
页(从-至) | 908-910 |
页数 | 3 |
期刊 | Applied Mathematics Letters |
卷 | 24 |
期 | 6 |
DOI | |
出版状态 | 已出版 - 6月 2011 |