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 条

[31] Non-uniform random spanning trees on weighted graphs
Mosbah, M
Saheb, N
THEORETICAL COMPUTER SCIENCE, 1999, 218 (02) : 263 - 271
[32] Diameter-Preserving Spanning Trees in Sparse Weighted Graphs
Liu, Yue
Huang, Jing
GRAPHS AND COMBINATORICS, 2009, 25 (05) : 753 - 758
[33] On plane spanning trees and cycles of multicolored point sets with few intersections
Kano, A
Merino, C
Urrutia, J
INFORMATION PROCESSING LETTERS, 2005, 93 (06) : 301 - 306
[34] An implicit weighted degree condition for heavy cycles in weighted graphs
Chen, Bing
Zhang, Shenggui
Cheng, T. C. Edwin
DISCRETE GEOMETRY, COMBINATORICS AND GRAPH THEORY, 2007, 4381 : 21 - +
[35] Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity
Gargano, Luisa
Rescigno, Adele A.
STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, SIROCCO 2023, 2023, 13892 : 502 - 519
[36] Spanning Trees of Connected K1,t-free Graphs Whose Stems Have a Few Leaves
Pham Hoang Ha
Dang Dinh Hanh
BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2020, 43 (03) : 2373 - 2383
[37] Conditions for Implicit-Degree Sum for Spanning Trees with Few Leaves in K1,4-Free Graphs
Cai, Junqing
Lin, Cheng-Kuan
Sun, Qiang
Wang, Panpan
MATHEMATICS, 2023, 11 (24)
[38] Approximation algorithms for maximum weighted internal spanning trees in regular graphs and subdivisions of graphs
Hakim, Sheikh Azizul
Nishat, Rahnuma Islam
Rahman, Md Saidur
COMPUTER JOURNAL, 2024, 67 (10): : 2898 - 2905
[39] Determining possible sets of leaves for spanning trees of dually chordal graphs
De Caria, Pablo
Gutierrez, Marisa
ARS COMBINATORIA, 2015, 122 : 13 - 20
[40] ALGORITHMS FOR ENUMERATING ALL SPANNING-TREES OF UNDIRECTED AND WEIGHTED GRAPHS
KAPOOR, S
RAMESH, H
SIAM JOURNAL ON COMPUTING, 1995, 24 (02) : 247 - 265

← 1 2 3 4 5 →