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 条

[41] The number of spanning trees of a family of 2-separable weighted graphs
Gong, Helin
Li, Shuli
DISCRETE APPLIED MATHEMATICS, 2017, 229 : 154 - 160
[42] Spanning trees of bipartite graphs with a bounded number of leaves and branch vertices
Huang, Xinyu
Yan, Zheng
DISCRETE APPLIED MATHEMATICS, 2025, 363 : 105 - 109
[43] Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs
Luo, Mao
Qin, Huigang
Wu, Xinyun
Xiong, Caiquan
Xia, Dahai
Ke, Yuanzhi
MATHEMATICS, 2024, 12 (07)
[44] A Dirac Type Condition for Heavy Cycles in Weighted Graphs
LI Ping (School of Mathematical Science
数学季刊, 2007, (01) : 87 - 93
[45] A fan type condition for heavy cycles in weighted graphs
Zhang, SG
Broersma, H
Li, XL
Wang, L
GRAPHS AND COMBINATORICS, 2002, 18 (01) : 193 - 200
[46] A Fan Type Condition For Heavy Cycles in Weighted Graphs
Shenggui Zhang
Hajo Broersma
Xueliang Li
Ligong Wang
Graphs and Combinatorics, 2002, 18 : 193 - 200
[47] On spanning cycles, paths and trees
Mukwembi, Simon
DISCRETE APPLIED MATHEMATICS, 2013, 161 (13-14) : 2217 - 2222
[48] CYCLES AND SPANNING-TREES
SJOGREN, JA
MATHEMATICAL AND COMPUTER MODELLING, 1991, 15 (09) : 87 - 102
[49] Spanning trees with many leaves
Karpov D.V.
Journal of Mathematical Sciences, 2011, 179 (5) : 616 - 620
[50] Spanning trees with many leaves
Ding, GL
Johnson, T
Seymour, P
JOURNAL OF GRAPH THEORY, 2001, 37 (04) : 189 - 197

← 1 2 3 4 5 →