Weighted degrees and heavy cycles in weighted graphs

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

A weighted graph is a graph provided with an edge-weighting functionw from the edge set to nonnegative real numbers. Bondy and Fan [Annals of Discrete Math. 41 (1989), 53-69] began the study on the existence of heavy cycles in weighted graphs. Though several results with Dirac-type degree condition can be generalized to an Ore-type one in unweighted graphs, it is shown in Bondy et al. [Discuss. Math. Graph Theory 22 (2002), 7-15] that Bondy and Fan's theorem, which uses Dirac-type condition, cannot be generalized analogously by using Ore-type condition. In this paper we investigate the property peculiar to weighted graphs, and prove a theorem on the existence of heavy cycles in weighted graphs under an Ore-type condition, which generalizes Bondy and Fan's theorem. Moreover, we show the existence of heavy cycles passing through some specified vertices.

Original languageEnglish
Pages (from-to)6483-6495
Number of pages13
JournalDiscrete Mathematics
Volume309
Issue number23-24
DOIs
Publication statusPublished - 2009 Dec 6
Externally publishedYes

Fingerprint

Weighted Graph
Ores
Fans
Cycle
Paul Adrien Maurice Dirac
Graph theory
Theorem
Degree Condition
Graph in graph theory
Weighting
Non-negative
Generalise

Keywords

  • Heavy cycle
  • Weighted degree
  • Weighted graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Weighted degrees and heavy cycles in weighted graphs. / Fujisawa, Jun.

In: Discrete Mathematics, Vol. 309, No. 23-24, 06.12.2009, p. 6483-6495.

Research output: Contribution to journalArticle

@article{6127d46d48424443abb60af035722701,
title = "Weighted degrees and heavy cycles in weighted graphs",
abstract = "A weighted graph is a graph provided with an edge-weighting functionw from the edge set to nonnegative real numbers. Bondy and Fan [Annals of Discrete Math. 41 (1989), 53-69] began the study on the existence of heavy cycles in weighted graphs. Though several results with Dirac-type degree condition can be generalized to an Ore-type one in unweighted graphs, it is shown in Bondy et al. [Discuss. Math. Graph Theory 22 (2002), 7-15] that Bondy and Fan's theorem, which uses Dirac-type condition, cannot be generalized analogously by using Ore-type condition. In this paper we investigate the property peculiar to weighted graphs, and prove a theorem on the existence of heavy cycles in weighted graphs under an Ore-type condition, which generalizes Bondy and Fan's theorem. Moreover, we show the existence of heavy cycles passing through some specified vertices.",
keywords = "Heavy cycle, Weighted degree, Weighted graph",
author = "Jun Fujisawa",
year = "2009",
month = "12",
day = "6",
doi = "10.1016/j.disc.2009.06.020",
language = "English",
volume = "309",
pages = "6483--6495",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "23-24",

}

TY - JOUR

T1 - Weighted degrees and heavy cycles in weighted graphs

AU - Fujisawa, Jun

PY - 2009/12/6

Y1 - 2009/12/6

N2 - A weighted graph is a graph provided with an edge-weighting functionw from the edge set to nonnegative real numbers. Bondy and Fan [Annals of Discrete Math. 41 (1989), 53-69] began the study on the existence of heavy cycles in weighted graphs. Though several results with Dirac-type degree condition can be generalized to an Ore-type one in unweighted graphs, it is shown in Bondy et al. [Discuss. Math. Graph Theory 22 (2002), 7-15] that Bondy and Fan's theorem, which uses Dirac-type condition, cannot be generalized analogously by using Ore-type condition. In this paper we investigate the property peculiar to weighted graphs, and prove a theorem on the existence of heavy cycles in weighted graphs under an Ore-type condition, which generalizes Bondy and Fan's theorem. Moreover, we show the existence of heavy cycles passing through some specified vertices.

AB - A weighted graph is a graph provided with an edge-weighting functionw from the edge set to nonnegative real numbers. Bondy and Fan [Annals of Discrete Math. 41 (1989), 53-69] began the study on the existence of heavy cycles in weighted graphs. Though several results with Dirac-type degree condition can be generalized to an Ore-type one in unweighted graphs, it is shown in Bondy et al. [Discuss. Math. Graph Theory 22 (2002), 7-15] that Bondy and Fan's theorem, which uses Dirac-type condition, cannot be generalized analogously by using Ore-type condition. In this paper we investigate the property peculiar to weighted graphs, and prove a theorem on the existence of heavy cycles in weighted graphs under an Ore-type condition, which generalizes Bondy and Fan's theorem. Moreover, we show the existence of heavy cycles passing through some specified vertices.

KW - Heavy cycle

KW - Weighted degree

KW - Weighted graph

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

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

U2 - 10.1016/j.disc.2009.06.020

DO - 10.1016/j.disc.2009.06.020

M3 - Article

VL - 309

SP - 6483

EP - 6495

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 23-24

ER -