Heavy cycles and spanning trees with few leaves in weighted graphs

Binlong Li; Shenggui Zhang

doi:10.1016/j.aml.2010.12.049

Heavy cycles and spanning trees with few leaves in weighted graphs

Binlong Li, Shenggui Zhang

School of Mathematics and Statistics

Northwestern Polytechnical University Xian

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	908-910
Number of pages	3
Journal	Applied Mathematics Letters
Volume	24
Issue number	6
DOIs	https://doi.org/10.1016/j.aml.2010.12.049
State	Published - Jun 2011

Keywords

Heavy cycles
Spanning trees
Weighted graphs

Access to Document

10.1016/j.aml.2010.12.049

Cite this

@article{4190e65f797945e29295a23d0eeb98de,

title = "Heavy cycles and spanning trees with few leaves in weighted graphs",

abstract = "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.",

keywords = "Heavy cycles, Spanning trees, Weighted graphs",

author = "Binlong Li and Shenggui Zhang",

year = "2011",

month = jun,

doi = "10.1016/j.aml.2010.12.049",

language = "英语",

volume = "24",

pages = "908--910",

journal = "Applied Mathematics Letters",

issn = "0893-9659",

publisher = "Elsevier Ltd",

number = "6",

}

TY - JOUR

T1 - Heavy cycles and spanning trees with few leaves in weighted graphs

AU - Li, Binlong

AU - Zhang, Shenggui

PY - 2011/6

Y1 - 2011/6

N2 - 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.

AB - 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.

KW - Heavy cycles

KW - Spanning trees

KW - Weighted graphs

UR - http://www.scopus.com/inward/record.url?scp=79952452317&partnerID=8YFLogxK

U2 - 10.1016/j.aml.2010.12.049

DO - 10.1016/j.aml.2010.12.049

M3 - 文章

AN - SCOPUS:79952452317

SN - 0893-9659

VL - 24

SP - 908

EP - 910

JO - Applied Mathematics Letters

JF - Applied Mathematics Letters

IS - 6

ER -

Heavy cycles and spanning trees with few leaves in weighted graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this