Heavy cycles in 2-connected weighted graphs with large weighted degree sums

Bing Chen, Shenggui Zhang, T. C.Edwin Cheng

科研成果: 书/报告/会议事项章节会议稿件同行评审

1 引用 (Scopus)

摘要

In this paper, we prove that a 2-connected weighted graph G contains either a Hamilton cycle or a cycle of weight at least 2m/3 if it satisfies the following conditions: (1) Σi=13 dw (vi) ≤ m, where v1, v2 and v3 are three pairwise nonadjacent vertices of G, and two of them are nonadjacent vertices of an induced claw or an induced modified claw; (2) In each induced claw and each induced modified claw of G, all edges have the same weight. This extends several previous results on the existence of heavy cycles in weighted graphs.

源语言英语
主期刊名Computational Science - ICCS 2007 - 7th International Conference, Proceedings
出版商Springer Verlag
338-346
页数9
版本PART 3
ISBN(印刷版)9783540725879
DOI
出版状态已出版 - 2007
活动7th International Conference on Computational Science, ICCS 2007 - Beijing, 中国
期限: 27 5月 200730 5月 2007

出版系列

姓名Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
编号PART 3
4489 LNCS
ISSN(印刷版)0302-9743
ISSN(电子版)1611-3349

会议

会议7th International Conference on Computational Science, ICCS 2007
国家/地区中国
Beijing
时期27/05/0730/05/07

指纹

探究 'Heavy cycles in 2-connected weighted graphs with large weighted degree sums' 的科研主题。它们共同构成独一无二的指纹。

引用此