Ore-type degree condition for heavy paths in weighted graphs

Hikoe Enomoto, Jun Fujisawa, Katsuhiro Ota

研究成果: Article査読

1 被引用数 (Scopus)

抄録

A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. For a vertex v of a weighted graph, dw(v) is the sum of the weights of the edges incident to v. And the weight of a path is the sum of the weights of the edges belonging to it. In this paper, we give a sufficient condition for a weighted graph to have a heavy path which joins two specified vertices. Let G be a 2-connected weighted graph and let x and y be distinct vertices of G. Suppose that dw(u)+dw(v)≥2d for every pair of non-adjacent vertices u and v∈V(G)\{x,y}. Then x and y are joined by a path of weight at least d, or they are joined by a Hamilton path. Also, we consider the case when G has some vertices whose weighted degree are not assumed.

本文言語English
ページ(範囲)100-109
ページ数10
ジャーナルDiscrete Mathematics
300
1-3
DOI
出版ステータスPublished - 2005 9 6

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 離散数学と組合せ数学

フィンガープリント

「Ore-type degree condition for heavy paths in weighted graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル