A σk type condition for heavy cycles in weighted graphs

Hikoe Enomoto, Jun Fujisawa, Katsuhiro Ota

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

A weighted graph is one in which every edge e is assigned a non-negative number, called the weight, of e. For a vertex v of a weighted graph, d w(v) is the sum of the weights of the edges incident with v. For a subgraph H of a weighted graph G, the weight of H is the sum of the weights of the edges belonging to H. In this paper, we give a new sufficient condition for a weighted graph to have a heavy cycle. Let G be a k-connected weighted graph where 2 ≤ k. Then G contains either a Hamilton cycle or a cycle of weight at least 2m/(k+1), if G satisfies the following conditions: (1) The weighted degree sum of any k independent vertices is at least m, (2) w(xz) = w(yz) for every vertex z ε N(x) ∩ N (y) with d(x,y) = 2, arid (4) In every triangle T of G, either all edges of T have different weights or all edges of T have the same weight.

Original languageEnglish
Pages (from-to)225-232
Number of pages8
JournalArs Combinatoria
Volume76
Publication statusPublished - 2005 Jul

Fingerprint

Weighted Graph
Cycle
Degree Sum
Hamilton Cycle
Vertex of a graph
Weighted Sums
Connected graph
Subgraph
Triangle
Non-negative
Sufficient Conditions

Keywords

  • Heavy cycle
  • Weighted degree sum
  • Weighted graph

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

A σk type condition for heavy cycles in weighted graphs. / Enomoto, Hikoe; Fujisawa, Jun; Ota, Katsuhiro.

In: Ars Combinatoria, Vol. 76, 07.2005, p. 225-232.

Research output: Contribution to journalArticle

@article{ab6fdb5c2623407a8f8e5364574b13aa,
title = "A σk type condition for heavy cycles in weighted graphs",
abstract = "A weighted graph is one in which every edge e is assigned a non-negative number, called the weight, of e. For a vertex v of a weighted graph, d w(v) is the sum of the weights of the edges incident with v. For a subgraph H of a weighted graph G, the weight of H is the sum of the weights of the edges belonging to H. In this paper, we give a new sufficient condition for a weighted graph to have a heavy cycle. Let G be a k-connected weighted graph where 2 ≤ k. Then G contains either a Hamilton cycle or a cycle of weight at least 2m/(k+1), if G satisfies the following conditions: (1) The weighted degree sum of any k independent vertices is at least m, (2) w(xz) = w(yz) for every vertex z ε N(x) ∩ N (y) with d(x,y) = 2, arid (4) In every triangle T of G, either all edges of T have different weights or all edges of T have the same weight.",
keywords = "Heavy cycle, Weighted degree sum, Weighted graph",
author = "Hikoe Enomoto and Jun Fujisawa and Katsuhiro Ota",
year = "2005",
month = "7",
language = "English",
volume = "76",
pages = "225--232",
journal = "Ars Combinatoria",
issn = "0381-7032",
publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - A σk type condition for heavy cycles in weighted graphs

AU - Enomoto, Hikoe

AU - Fujisawa, Jun

AU - Ota, Katsuhiro

PY - 2005/7

Y1 - 2005/7

N2 - A weighted graph is one in which every edge e is assigned a non-negative number, called the weight, of e. For a vertex v of a weighted graph, d w(v) is the sum of the weights of the edges incident with v. For a subgraph H of a weighted graph G, the weight of H is the sum of the weights of the edges belonging to H. In this paper, we give a new sufficient condition for a weighted graph to have a heavy cycle. Let G be a k-connected weighted graph where 2 ≤ k. Then G contains either a Hamilton cycle or a cycle of weight at least 2m/(k+1), if G satisfies the following conditions: (1) The weighted degree sum of any k independent vertices is at least m, (2) w(xz) = w(yz) for every vertex z ε N(x) ∩ N (y) with d(x,y) = 2, arid (4) In every triangle T of G, either all edges of T have different weights or all edges of T have the same weight.

AB - A weighted graph is one in which every edge e is assigned a non-negative number, called the weight, of e. For a vertex v of a weighted graph, d w(v) is the sum of the weights of the edges incident with v. For a subgraph H of a weighted graph G, the weight of H is the sum of the weights of the edges belonging to H. In this paper, we give a new sufficient condition for a weighted graph to have a heavy cycle. Let G be a k-connected weighted graph where 2 ≤ k. Then G contains either a Hamilton cycle or a cycle of weight at least 2m/(k+1), if G satisfies the following conditions: (1) The weighted degree sum of any k independent vertices is at least m, (2) w(xz) = w(yz) for every vertex z ε N(x) ∩ N (y) with d(x,y) = 2, arid (4) In every triangle T of G, either all edges of T have different weights or all edges of T have the same weight.

KW - Heavy cycle

KW - Weighted degree sum

KW - Weighted graph

UR - http://www.scopus.com/inward/record.url?scp=33644667582&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33644667582&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33644667582

VL - 76

SP - 225

EP - 232

JO - Ars Combinatoria

JF - Ars Combinatoria

SN - 0381-7032

ER -