Heavy cycles and spanning trees with few leaves in weighted graphs

被引：1

作者：

Li, Binlong ^{[1
]}

Zhang, Shenggui ^{[1
]}

机构：

[1] Northwestern Polytech Univ, Dept Appl Math, Xian 710072, Shaanxi, Peoples R China

来源：

APPLIED MATHEMATICS LETTERS | 2011年 / 24卷 / 06期

关键词：

Weighted graphs; Heavy cycles; Spanning trees;

D O I：

10.1016/j.aml.2010.12.049

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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. (C) 2011 Elsevier Ltd. All rights reserved.

引用

页码：908 / 910

页数：3

共 50 条

[21] Ordering trees and graphs with few cycles by algebraic connectivity
Abreu, Nair
Justel, Claudia Marcela
Rojo, Oscar
Trevisan, Vilmar
LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 458 : 429 - 453
[22] Spanning trees of K1,4-free graphs whose reducible stems have few leaves
Ha, Pham Hoang
Nam, Le Dinh
Pham, Ngoc Diep
PERIODICA MATHEMATICA HUNGARICA, 2024, 89 (01) : 61 - 71
[23] Bounds of the number of leaves of spanning trees in graphs without triangles
A. V. Bankevich
Journal of Mathematical Sciences, 2012, 184 (5) : 557 - 563
[24] Weighted spanning trees on some self-similar graphs
D'Angeli, Daniele
Donno, Alfredo
ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
[25] Spanning trees with many leaves in graphs with minimum degree three
Bonsma, Paul S.
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2008, 22 (03) : 920 - 937
[26] A σκ type condition for heavy cycles in weighted graphs
Enomoto, H
Fujisawa, J
Ota, K
ARS COMBINATORIA, 2005, 76 : 225 - 232
[27] Claw conditions for heavy cycles in weighted graphs
Fujisawa, J
GRAPHS AND COMBINATORICS, 2005, 21 (02) : 217 - 229
[28] Claw Conditions for Heavy Cycles in Weighted Graphs
Jun Fujisawa
Graphs and Combinatorics, 2005, 21 : 217 - 229
[29] Spanning trees with many leaves in graphs without diamonds and blossoms
Bonsma, Paul
Zickfeld, Florian
LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 531 - 543
[30] Diameter-Preserving Spanning Trees in Sparse Weighted Graphs
Yue Liu
Jing Huang
Graphs and Combinatorics, 2009, 25 : 753 - 758

← 1 2 3 4 5 →