Heavy cycles and spanning trees with few leaves in weighted graphs

Binlong Li, Shenggui Zhang

科研成果: 期刊稿件文章同行评审

1 引用 (Scopus)

摘要

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

指纹

探究 'Heavy cycles and spanning trees with few leaves in weighted graphs' 的科研主题。它们共同构成独一无二的指纹。

引用此