Heavy fans, cycles and paths in weighted graphs of large connectivity

研究成果: Article

1 引用 (Scopus)

抜粋

A set of paths joining a vertex y and a vertex set L is called (y, L)-fan if any two of the paths have only y in common, and its width is the number of paths forming it. In weighted graphs, it is known that the existence of heavy fan is useful to find a heavy cycle containing some specified vertices. In this paper, we show the existence of heavy fans with large width containing some specified vertices in weighted graphs of large connectivity, which is a weighted analogue of Perfect's theorem. Using this, in 3-connected weighted graphs, we can find heavy cycles containing three specified vertices, and also heavy paths joining two specified vertices containing two more specified vertices. These results extend the previous results in 2-connected weighted graphs to 3-connected weighted graphs.

元の言語English
ページ(範囲)38-53
ページ数16
ジャーナルDiscrete Mathematics
307
発行部数1
DOI
出版物ステータスPublished - 2007 1 6

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

フィンガープリント Heavy fans, cycles and paths in weighted graphs of large connectivity' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用